Skip to content
UPEEC

Sort the Array

Easy#sorting· solved by 0 · time limit 2.0 s

Sort nn integers in non-decreasing order. Try writing your own sort (merge sort or quick sort) before using the library one!

Input

nn, then nn integers.

Output

The sorted array.

Constraints

1≤n≤1051 \le n \le 10^5

Sample 1

Input

6
5 2 9 1 5 6

Output

1 2 5 5 6 9

Sign in or join free to run and submit your solution.