e-olymp
favorite We need a little bit of your help to keep things running, click on this banner to learn more
Problems

Inverse permutation

Inverse permutation

Given a permutation p, find its inverse p-1.

Input

First line contains the order n (0 < n20000) of permutation p. Second line contains the permutation p.

Output

In one line print the inverse permutation p-1.

Time limit 1 second
Memory limit 128 MiB
Input example #1
3
2 3 1
Output example #1
3 1 2