P1017 Mission 1 - II : The Ques of the Guards

Difficulty: $\color{green}1050$

Problem Background

Radar finally passed the road successfully and safely! Now he’s at the CZYAKIOI (the CZY Accepted Kingdom IOI Campus, you know)’s Capital City and is ready to enter. But as it is the CZYAKIOI‘s capital, it’s not very easy to enter. You must answer a question from the guards.

When Radar get to the Gate, the Guards are playing a Math Game. So they give Radar a question related to easy Math…

Problem Statement

The Guards give Radar a set of $n$ integers $\left\{A_1, A_2, A_3, \cdots, A_{n-2}, A_{n-1}, A_n\right\}$, and Radar needs to sort them into a ascending sequence, and then tell the Guards what it is.

Yeah, it is just this?

Input

The Input is given from Standard Input ($\color{red}\texttt{stdin}$) in the Following Format:

$n$

$A_1\ A_2\ A_3\ A_4\ \cdots\ A_{N-2}\ A_{N-1}\ A_{N}$

Output

Print one line with $n$ integers: the sorted sequence.

Samples

Input 1

5
3 6 2 4 1

Output 1

1 2 3 4 6

Input 2

20
90 32 42 19 324 1 3 12 42 13 52 25 1345 432 24 32 1543 242555 4325245325254532235 98

Output 2

1 3 12 13 19 24 25 32 32 42 42 52 90 98 324 432 1345 1543 242555 43252245325254532235

Input 3

5
11111111111111111111 43214125321451531552 245145145325435435 543531454354315435432543531532513 14543153154543154315431543151354315465652362353

Output 3

245145145325435435 11111111111111111111 43214125321451531552 543531454354315435432543531532513 14543153154543154315431543151354315465652362353

Input 4

25
39217462174 83274983217432174 321983249983214 4324 4748932749832174987987 83274321748327434 8324747 32972195709437509431572934321 484217592174092174825 842179321 98327437421 83274982 598425797509421754218 321493217432174 21598732194872149214 84257984215 42821983217498 21498321749832174 2179832174932174 32173217 732017400932148 937498732109821 301831724981 9843709217401788 73681

Output 4

4324 73681 8324747 32173217 83274982 842179321 39217462174 84257984215 98327437421 301831724981 42821983217498 321493217432174 321983249983214 732017400932148 937498732109821 2179832174932174 9843709217401788 21498321749832174 83274321748327434 83274983217432174 1598732194872149214 484217592174092174825 598425797509421754218 4748932749832174987987 32972195709437509431572934321

Constraints

• All the Input are Integers.
• For all test cases:
  • $1 \le n \le \left(2 \times 10^{5}\right)$
  • $1 \le A_i \le \left(10^{10^{2}}\right)$
• $\color{gold}\Large{\texttt{This Problem Has Partial Points.}}$
• Print samples for $0$ points ($\color{red}\texttt{sample1}\sim\texttt{sample4}\texttt{, 0pt/tc}$).
• For $15$ points after ($\color{red}\texttt{subtI1}\sim\texttt{subtI15}\texttt{, 1pt/tc}$) :
  • $1 \le n \le 1000$.
• For $20$ points after ($\color{red}\texttt{subtII1}\sim\texttt{subtII10}\texttt{, 2pts/tc}$) :
  • $1 \le n \le 10000$.
• For $45$ points after ($\color{red}\texttt{subtIII1}\sim\texttt{subtIII15}\texttt{, 3pts/tc}$) :
  • $10001 \le n \le 200000$.
• For the last $20$ points ($\color{red}\texttt{subtmax1}\sim\texttt{subtmax5}\texttt{, 4pts/tc}$) :
  • $n=200000$.
  • $\left|A_i\right| = 10^2$ ($\left|t\right|$ is the length of $t$).
• $100$ points in total.