Problem 0J. Javelin-throwing ≡

Statement

Once upon a time, Eugene and Angelica found themselves at a javelin throwing competition as spectators. N athletes were participating in the competition.

Each time the i-th athlete threw the javelin, Eugene would inform Angelica about the distance the athlete threw the javelin (it happened that all the numbers Eugene mentioned were pairwise distinct). At the same time, Angelica recorded on a piece of paper the place that the i-th athlete would take after their throw.

Unfortunately, when the competition ended, Angelica lost the sheet of paper and was very upset. But Eugene remembers how many meters each athlete threw their javelin. Help the kids restore the lost sheet!

Input format

The first line of input contains a natural number N — the number of athletes.

The second line contains a sequence of distinct natural numbers L, where L_i — is the number indicating how many meters the i-th athlete threw their javelin.

Output format

In a single line, output a sequence of N natural numbers, where the i-th number indicates the place that the i-th athlete takes after their throw.

Constraints

1 ≤ N ≤ 10⁵, 1 ≤ L_i ≤ 10⁹

Example explanation

The first athlete threw the javelin and became the first in the list. The second athlete threw the javelin farther than the first and became the first in the list. The third athlete threw farther than the first but closer than the second, so the third became the second in the list. The fourth athlete threw farther than the first but closer than the second and the third, so the fourth became the third in the list.

Sample tests

4
20 40 30 25

1 1 2 3