Restore the permutation#1790
Given permutation . Let f_i be the number of such that p_j > p_i and j < i. The array is called the inversion table of permutation . Given the inversion table, restore the permutation.
The first line contains the order (0 < n \le 2000) of the permutation . The second line contains the inversion table .
Print the restored permutation .
Example 1