Sort of Sort

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$.