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 (Clang 3.8.0) (judge verdict: Wrong Answer)

#include<stdio.h>

int main()
{
  int n,a[100001],b[100001];
  scanf("%d",&n);
  for(int i=0;i<n;i++)
    {
      scanf("%d",&a[i]);
    }
  int k=n;

  /* for(int j=0;j<n;j++){
    for(int i=0;i<n;i++)
      {
	if(a[i]==k-j)
	  {
	    b[j]=a[i];
	    j++;
	    i=0;
	  }
      }
  }
   for(int i=0;i<n;i++)
    {
      printf("%d",b[i]);
    }
  */
  for(int i=0;i<n;i++)
    b[a[i]-1]=i+1;//配列は０からはじまるので、a[i]-1であり、i+1である
  for(int i=0;i<n;i++)
    printf("%d",a[i]);
  return 0;
  
  
}