Problem:
Score : 300 points

Problem Statement

Takahashi is a teacher responsible for a class of N students.

The students are given distinct student numbers from 1 to N.

Today, all the students entered the classroom at different times.

According to Takahashi's record, there were A_i students in the classroom when student number i entered the classroom (including student number i).

From these records, reconstruct the order in which the students entered the classroom.

Constraints

1 \le N \le 10^5

1 \le A_i \le N

A_i \neq A_j (i \neq j)

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
A_1 A_2 \ldots A_N

Output

Print the student numbers of the students in the order the students entered the classroom.

Sample Input 1

3
2 3 1

Sample Output 1

3 1 2

First, student number 3 entered the classroom.

Then, student number 1 entered the classroom.

Finally, student number 2 entered the classroom.

Sample Input 2

5
1 2 3 4 5

Sample Output 2

1 2 3 4 5

Sample Input 3

8
8 2 7 3 4 5 6 1

Sample Output 3

8 2 4 5 6 7 3 1

Solution in Ruby (2.3.3) (judge verdict: Accepted)

def inpf() a=gets.chomp.split(" ").map(&:to_f)end
 
def inps() a=gets.chomp.split(" ")end
 
def copy(a) Marshal.load(Marshal.dump(a)) end
 
def kaijo(n,r = 10**9+7)(n < 2)? 1 : (2..n).inject{|memo,u|memo=(memo*u)%r} end
 
def na(n,d=0) Array.new(n,d)end
 
def na2(n,m,d=0) Array.new(n){Array.new(m,d)}end
 
def na3(n,m,l,d=0) Array.new(n){Array.new(m){Array.new(l,d)}}end
 
def inp() a=gets.chomp.split(" ").map(&:to_i)end
 
def r_up(a, b) (a+b-1)/b end
 
n = inp[0]
a = inp
t = []
n.times do |i|
  t[i] = [a[i],i+1]
end
t.sort!
ans = []
t.each do |a|
  ans.push(a[1])
end
puts ans.join(" ")