The permutation p is given. Let fi[i]
be the number of such j that p[j]
> p[i]
and j < i. The array fi is called an inversion table for permutation p. Given the inversion table, restore the permutation.
First line contains the order n (0 < n ≤ 2000) of permutation p. Second line contains the table of inversions fi.
Print the permutation p.