A12800 | Restore Permutation

An array of integers $p_{1},p_{2}, \ldots,p_{n}$ is called a permutation if it contains each number from $1$ to $n$ exactly once. For example, the following arrays are permutations: $[3,1,2], [1], [1,2,3,4,5]$ and $[4,3,1,2]$ . The following arrays are not permutations: $[2], [1,1], [2,3,4]$ .

There is a hidden permutation of length $n$ .

For each index $i$ , you are given $s_{i}$ , which equals to the sum of all $p_{j}$ such that $j < i$ and $p_{j} < p_{i}$ . In other words, $s_i$ is the sum of elements before the $i$ -th element that are smaller than the $i$ -th element.

Your task is to restore the permutation.

The first line contains a single integer $n$ ( $1 \le n \le 2 \cdot 10^{5}$ ) — the size of the permutation.

The second line contains $n$ integers $s_{1}, s_{2}, \ldots, s_{n}$ ( $0 \le s_{i} \le \frac{n(n-1)}{2}$ ).

It is guaranteed that the array $s$ corresponds to a valid permutation of length $n$ .

Print $n$ integers $p_{1}, p_{2}, \ldots, p_{n}$ — the elements of the restored permutation. We can show that the answer is always unique.