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)

n=gets.to_i
a=gets.chomp.split(" ").map(&:to_i)

def QuickSort(sort_target,list,left,right)
  i=left+1
  k=right
  while i<k
    i+=1 while sort_target[i]<sort_target[left] and i<right
    k-=1 while sort_target[k]>=sort_target[left] and k>left
    if i<k
      sort_target[i],sort_target[k]=sort_target[k],sort_target[i]
      list[i],list[k]=list[k],list[i]
    end
  end
  if sort_target[left]>sort_target[k]
    sort_target[left],sort_target[k]=sort_target[k],sort_target[left]
    list[left],list[k]=list[k],list[left]
  end
  QuickSort(sort_target,list,left,k-1) if left<k-1
  QuickSort(sort_target,list,k+1,right) if k+1<right
  return list
end
puts QuickSort(a,Array.new(n){|i| i+1},0,n-1).join(" ")