Marathon Bib Finish Order Recovery

A city marathon assigns every runner a unique bib number from 0 to n-1. At the finish line, a timing chip system recorded, for each bib number, the numeric place in which that runner crossed the line (1st, 2nd, and so on) — but a printer malfunction means only this bib-to-place lookup survived, not the ordered results sheet itself. Given the lookup, reconstruct the finishing order: the list of bib numbers from whoever finished 1st down to whoever finished last.

Input format

• Line 1: a single integer n — the number of runners.
• Line 2: n space-separated integers place_0, place_1, ..., place_{n-1}, where place_i is the 1-indexed finishing place of the runner wearing bib i. These values form a permutation of 1..n.

Output format

Print a single line with n space-separated bib numbers, ordered from the runner who finished 1st to the runner who finished last.

Constraints

• 1 <= n <= 100000
• place is a permutation of the integers 1 to n

5
3 1 4 2 5

1 3 0 2 4

1
1

0