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>
void swap(int *p, int *q){
  int tmp;
  tmp = *p;
  *p = *q;
  *q = tmp;
}


/*
A[0], A[1], ..., A[n-1] をソートして昇順に書き換える関数
*/
void quick_sort(int A[], int B[], int n){
    int i, j,pivot, ax;
    // 真ん中の要素をピボットとする
    if(n <= 1)  return ;
    pivot = A[n/2];
    A[n/2] = A[0];
    A[0] = pivot;
    ax = B[n/2];
    B[n/2] = B[0];
    B[0] = ax;  
    for(i = j = 1; i < n; i++){
        if(A[i] <= pivot){
            swap(A+i, A+j);
            swap(B+i, B+j);
            j++;
        }
    }
    A[0] = A[j-1];
    B[0] = B[j-1];
    A[j-1] = pivot;
    B[j-1] = ax;
    quick_sort(A, B, j-1);
    quick_sort(A+j, B+j, n-j);
    
}





int main(){
  int n, k, i, c;
  
  scanf("%d", &n);
  int A[n];
  int B[n];
  for (i=0; i<n; i++) scanf("%d", &A[i]);
  for (i=0; i<n; i++) {
    B[i] = i+1;
  }

  quick_sort(A, B, n);
  for (i=0; i<n; i++){
    printf("%d ", B[i]);
  }

  return 0;

  
  
  }