시간 제한메모리 제한제출정답맞힌 사람정답 비율
1 초 2048 MB20314512168.750%

문제

Sorting takes so long... but if we don’t mind losing some data we can sort of sort much faster!

A sort of sorted list is a monotonically increasing list containing all elements of another list $a$ that were originally in sorted order. That is, a sort of sorted list obtained from list $a$ contains all $a_i$ such that $a_i≥a_j$ for all $0≤j<i$.

입력

The first line of input contains a single integer $N$, the length of the unsorted list ($1≤N≤100\,000$). The next line contains $N$ space separated integers $a_i$ ($-200\,000≤a_i≤200\,000$).

출력

Output a single line of space separated integers representing the sort of sorted list obtained from the given list $a$.

예제 입력 1

3
3 1 7

예제 출력 1

3 7

예제 입력 2

6
1 4 3 9 7 11

예제 출력 2

1 4 9 11

예제 입력 3

12
0 1 4 4 3 2 3 4 5 5 7 4

예제 출력 3

0 1 4 4 4 5 5 7