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 C (GCC 5.4.1) (judge verdict: Accepted)

#include <stdio.h>
int q_sort(int d[],int left,int right,int e[])
{
	if(left >= right) return 0;
	int pipot = d[(left+right)/2],l = left, r = right,tmp,tmpw;
	while(l < r){
		while(d[l] < pipot) l++;
		while(d[r] > pipot) r--;
		if(l <= r){
			tmp = d[l]; d[l] = d[r]; d[r] = tmp;
			tmpw = e[l];e[l] = e[r]; e[r] = tmpw;
			l++; r--;
		}
	}
	q_sort(d,left,r,e);
	q_sort(d,l,right,e);
}
int main(void){
	int N;
	scanf("%d",&N);
	int i,A[2][N];
	for(i=0;i<N;i++){
		scanf("%d",&A[1][i]);
		A[0][i] = i+1;
	}
	q_sort(A[1],0,N-1,A[0]);
	
	for(i=0;i<N;i++){
		printf("%d ",A[0][i]);
	}
	return 0;
}