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>
#define SIZE10 100000

typedef long long int ll;
typedef unsigned char u8;

int i = 0, j = 0;

struct student{
    int mem;
    int time;
};

int partition(struct student *num, int start, int end, int p);
void quicksort(struct student *num, int start, int end);


int partition(struct student *num, int start,int end, int p){
    i = start, j = end;
    struct student temp;
    while(i <= j){
        while(i <= end && num[i].mem <= p){
            i++;
        }
        while(j >= start && num[j].mem > p){
            j--;
        }

        if(i > j){
            break;
        }

        temp = num[i];
        num[i] = num[j];
        num[j] = temp;

    }
    return i;
}


void quicksort(struct student *num, int start, int end){
    if(start == end){
        return ;
    }
    int p = num[start].mem;
    int flg = 0;
    int base = start;
    int k = 0;
    while(base <= end){
        if(num[base].mem < p){
            flg = 1;
            p = num[base].mem;
            break;
        }else if(num[base].mem > p){
            flg = 1;
            break;
        }
        base++;
    }

    if(flg == 1){
        k = partition(num, start, end, p);
        quicksort(num, start, k-1);
        quicksort(num, k, end);
    }
}

int main(void){
    int N = 0;
    int A[SIZE10];
    struct student std[SIZE10];

    scanf("%d", &N);

    for(i = 0; i < N; i++){
        scanf("%d", &A[i]);
        std[i].mem = A[i];
        std[i].time = i ;
    }

    quicksort(std, 0, N-1);

    for(i = 0; i < N-1; i++){
        printf("%d ", std[i].time+1);
    }
    printf("%d", std[N-1].time+1);

    return 0;
}