There are $n$ runners participating in a race.
Each runner is assigned a unique number from $1$ to $n$.
They have arrived at the finish line in some specific order, with no ties.
Let us say that runner $i$ has performed an \textit{upset} of runner $j$ if $i$ finished before $j$ and $i < j$.

For each $i$ from $1$ to $n$, it is known that runner $i$ has performed exactly $a_i$ upsets of other runners.
Your task is to restore the competition results: the number of the runner that took first place, the number of the runner that took second place, \ldots, the number of the runner that took the $n$-th place.
It can be shown that the answer is always unique, assuming that it exists.
