We’re preparing your current view and syncing the latest data.
Sereja has n friends and for each friend he bought exactly one present. The presents are numbered from 1 to n. Sereja distributes presents in a way that for each friend i, present p_i is given. The input provides a permutation p of size n where p_i represents the recipient who gets present i. The task is to find for each friend i, the number indicating which present they will receive.
The first line contains an integer n (1 ≤ n ≤ 100) — the number of friends (and presents). The second line contains a permutation p of size n. The i-th number in the permutation is p_i — the friend who gets present i.
Print n integers a_1, a_2, ..., a_n where a_i is the number of the present friend i will receive.
1 ≤ n ≤ 100
Example 1
Input
4 2 3 4 1
Output
4 1 2 3
Explanation
Friend 1 receives present 4, friend 2 receives present 1, friend 3 receives present 2, and friend 4 receives present 3.