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: Time Limit Exceeded)

#include<stdio.h>

/*int intcomp(const int *a, const int *b){
  if(*a<*b)
  return 1;
  else if(*a>*b)
  return -1;
  else
  return 0;
}
*/

int main(void){

  typedef struct Student{
    int itu;
    int bango;
  }student;
    int n;
    int i,j;
    scanf("%d",&n);

    student st[n];//i番目の子が投稿した時点での教室にいる人の人数。
    student tmp;
    /*or(i=0;i<n;i++){
      st[i].bango=i+1;
    }*/
    for(i=0;i<n;i++){
      scanf("%d",&st[i].itu);
      st[i].bango=i+1;
    }

    for(i=0;i<n;i++){
      for(j=i+1;j<n;j++){
        if(st[i].itu>st[j].itu){
          tmp=st[i];
          st[i]=st[j];
          st[j]=tmp;
        }
        }
        printf("%d ",st[i].bango);
      }



    return 0;
}