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 Rust (1.15.1) (judge verdict: Accepted)

use std::io::{stdin, BufRead};

fn main() {
    let mut buf = String::new();
    stdin().read_line(&mut buf).unwrap();
    buf.clear();

    stdin().read_line(& mut buf).unwrap();
    let iter = buf.trim().split_whitespace();
    let mut student_id = 0;

    let mut student_array: Vec<[i32; 2]> = Vec::new();
    for students in iter{
        student_id += 1;
        student_array.push([student_id, students.parse::<i32>().unwrap()]);
    }

    print!("{}", solve(student_array));
}

fn solve(mut student_array: Vec<[i32; 2]>) -> String {
    student_array.sort_by(|array1, array2| array1[1].cmp(&array2[1]));
    let mut result = String::new();
    for iter in student_array.iter(){
        result.push_str(&format!("{}\n", iter[0]));
    }
    result
}