Problem A. Square sort ≡

Author:	StdAlg
Input file:	input.txt		Time limit:	1 sec
Output file:	output.txt		Memory limit:	8 Mb

Statement

You are to write a program that receives a sequence of integer numbers and sorts it, i. e. writes out all elements in ascending order.

Input file format

Input file contains integer N — length of the sequnece, followed by N integer numbers — elements of the sequence.

Output file format

Output file must contain N integer numbers, which must be elements of the source sequence printed in ascending order.

Constraints

0 ≤ N ≤ 3000. Sequence elements are less than 10⁹ by absolute value.

Sample tests

No.	Input file (input.txt)	Output file (output.txt)
1	5 4 3 10 3 1	1 3 3 4 10

---

Problem B. Lin-log sort ≡

Author:	StdAlg
Input file:	input.txt		Time limit:	1 sec
Output file:	output.txt		Memory limit:	8 Mb

Statement

You are to write a program that receives a sequence of integer numbers and sorts it, i. e. writes out all elements in ascending order.

Input file format

Input file contains integer N — length of the sequnece, followed by N integer numbers — elements of the sequence.

Output file format

Output file must contain N integer numbers, which must be elements of the source sequence printed in ascending order.

Constraints

0 ≤ N ≤ 100000. Sequence elements are less than 10⁹ by absolute value.

Sample tests

No.	Input file (input.txt)	Output file (output.txt)
1	5 4 3 10 3 1	1 3 3 4 10

---