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: Wrong Answer)

/* ABC141-C
   Takatan */

#include<stdio.h>
#include<stdlib.h>

typedef struct tnode{
    int id;
    int people;
    struct tnode *left;
    struct tnode *right;
} tnode;

tnode* createTNode(int id);
void insertTNode(tnode *new, tnode **first);
void printTree(tnode *first);
int main(void){
    int number, i;
    tnode *first = NULL, *new;

    scanf( "%d" , &number);
    for(i=0; i < number; i++){
        new = createTNode(i+1); /* 出席番号を引数とする */
        insertTNode(new, &first); /* 二分探索木に挿入 */
    }
    printTree(first); /* 教室にいた人数が少ない順に出力 */
    printf( "\b\n" );
    return 0;
}

tnode* createTNode(int id){ /* 新しいノードを作成する関数 */
    tnode *new = malloc(sizeof(tnode));

    if(new==NULL){
        exit(2);
    }

    new->id = id; /* 出席番号をコピー */
    scanf( "%d" , &(new->people));
    new->left = NULL;
    new->right = NULL;
    return(new);
}

void insertTNode(tnode *new, tnode **first){

    if(*first==NULL){
        *first = new; /* 1つ上が先端の時 */
    }else if((new->people)<((*first)->people)){
        /* 新しい生徒の方が教室にいた人が少ないとき、左を探索 */
        insertTNode(new, &((*first)->left)); /* 再帰的に実行 */
    }else{
        /* 新しい生徒の方が教室にいた人が多いとき、右を探索 */
        insertTNode(new, &((*first)->right)); /* 再帰的に実行 */
    }
}

void printTree(tnode *first){
    if(first->left!=NULL){ /* 左に子がいる時 */
        printTree(first->left); /* 再帰的に実行 */
    }
    printf( "%d " , first->id);
    if(first->right!=NULL){ /* 右に子がいる時 */
        printTree(first->right); /* 再帰的に実行 */
    }
}