Build Array from Permutation

Source: LeetCode

Version: Phuoc Hung OJ Extended

Problem

You are given a zero-based permutation $a_0,a_1,\ldots,a_{n-1}$ of $\{0,1,\ldots,n-1\}$.

Construct an array $b$ of length $n$ such that for every $0\le i<n$,

Because $a$ is a permutation, every $a_i$ is a valid index of $a$.

Input

The first line contains $n$. The second line contains a permutation $a_0,a_1,\ldots,a_{n-1}$ of $0..n-1$.

Output

Print $b_0,b_1,\ldots,b_{n-1}$ on one line.

Subtask

Subtask 1 (20 points): $1\le n\le 10$.

Subtask 2 (30 points): $1\le n\le 100$.

Subtask 3 (50 points): $1\le n\le 1000$.

Example

Input

6
0 2 1 5 3 4

Output

0 1 2 4 5 3

Explanation

The result follows directly from the mathematical definition above.