Inverse Permutation

Difficulty: 900 3000 ms 128 MB

implementation

The permutation P sends position i to value P_i. Print its inverse: the permutation Q with Q[P_i] = i.

Input: the first line has N; the second line has a permutation of 1..N.

Output: the inverse permutation.

Constraints:

• 1 ≤ N ≤ 10⁵

Sample Tests

4
2 4 1 3

3 1 4 2

1
1

1

Read the Editorial