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)

#include<stdio.h>
#include<stdbool.h>
void c_sort_p(int* a,int n,int* ans);
void swap(int* a, int* b);
int main(){
    int n;
    scanf("%d",&n);
    int a[n];
    int ans[n];
    for(int i = 0;i<n;i++){
        scanf("%d",&a[i]);
    }
    for(int i = 0;i<n;i++){
        ans[i] = (i + 1);
    }
    c_sort_p(a,n,ans);

    for(int i = 0;i<n;i++){
        printf("%d ",ans[i]);
    }
    return 0;

}
void c_sort_p(int* a,int n,int* ans){
    int h = n;
    bool swap_ = false;
    while(h>1 ||swap_){
        if(h > 1){
            h = (h * 10)/13;
        }
        swap_ = false;
        for(int i = 0;i + h<=n;i++){
            if(a[i]>a[i+h]){
                swap(&a[i],&a[i + h]);
                swap(&ans[i],&ans[i + h]);
                swap_ = true;
            }
        }
    }
}
void swap(int* a, int* b){
    int tmp;
    tmp = *a;
    *a = *b;
    *b = tmp;
}