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 OCaml (4.02.3) (judge verdict: Accepted)

type 'a tree =
    Leaf
  | Node of 'a tree * 'a * 'a tree

let empty = Leaf
          
let rec insert (x, i) t =
  match t with
    Leaf -> Node (Leaf, (x, i) , Leaf)
  | Node (l, (y, j), r) ->
     if x < y then
       Node (insert (x, i) l, (y, j), r)
     else
       Node (l, (y, j), insert (x, i) r)

let rec print_tree_int t =
  match t with
    Leaf -> ()
  | Node (l, (x, i), r) ->
     print_tree_int l;
     print_int i;
     print_char ' ' ;
     print_tree_int r
                
let i_inp_list : unit -> (int * int) list = fun () ->
  let inp_split = Str.split (Str.regexp " ") (input_line stdin) in
  List.mapi (fun i x -> (int_of_string x, i + 1)) (inp_split)
  
let () =
  let _ = Scanf.sscanf (input_line stdin) "%d" (fun a -> a) in
  let l = i_inp_list () in
  let ans = List.fold_left (fun t x -> insert x t) empty l in
  print_tree_int ans;
  print_newline ()