Presents

Source: Codeforces

Version: Phuoc Hung OJ Extended

Problem

There are $n$ friends numbered $1$ through $n$. Friend $i$ gives a present to friend $p_i$. The sequence $p_1,p_2,\ldots,p_n$ is a permutation of $1,2,\ldots,n$, so every friend receives exactly one present.

For every friend $j$, determine who gave a present to $j$.

Equivalently, construct the inverse permutation $q$ satisfying

Input

• The first line contains $n$.
• The second line contains the permutation $p_1,p_2,\ldots,p_n$.

Output

Print $q_1,q_2,\ldots,q_n$.

Subtasks

Subtask 1 (20 points): $1\le n\le 10$; $p_1,p_2,\ldots,p_n$ is a permutation of $1,2,\ldots,n$.

Subtask 2 (30 points): $1\le n\le 50$; $p_1,p_2,\ldots,p_n$ is a permutation of $1,2,\ldots,n$.

Subtask 3 (50 points): $1\le n\le 100$; $p_1,p_2,\ldots,p_n$ is a permutation of $1,2,\ldots,n$.

Example

Input

4
2 3 4 1

Output

4 1 2 3

Explanation

Since $p_1=2,p_2=3,p_3=4,p_4=1$, the givers for friends 1,2,3,4 are 4,1,2,3.