Reverse permutation

Problem description

A permutation is any sequence of numbers from 1 to N, σ=(σ₁, σ₂, ..., σ_n), where σ_i ≠ σ_j and 1 ≤ σ_i ≤ N, σ(i) = σ_i.

Product of permutations is calculated according to the next rule:
σ * π = (π(σ(1)), π(σ(2)), ..., π(σ(n))) = (π(σ₁), π(σ₂), ..., π(σ_n)).

Let permutation ε = (1, 2, ..., n). Then reverse permutation σ^-1 to permutation σ is such a permutation that σ * σ^-1 = ε.

Your task is to find a reverse permutation to given one.

Input

There is a single integer N on the first line (0 < N <= 20000) and N integers on the second line of input.

Output

Write reverse permutation.

Example