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: Time Limit Exceeded)

(*
ocamlfind ocamlopt -package batteries -linkpkg main.ml -o a.out
*)
open Batteries
open BatList

let n = Scanf.sscanf (read_line ()) "%d" (
        fun n -> 
                n
)

let lst = Str.split (Str.regexp " ") (read_line ())
          |> BatList.map int_of_string

let lst2 = BatList.map2 (fun i elmnt -> (i, elmnt)) (BatList.range 1 `To n) lst
           |> BatList.fast_sort (fun (ai, ae) (bi, be) -> if ae = be then 0 else if ae < be then -1 else 1)
           |> BatList.map (fun (i, e) -> string_of_int i)

let () = 
        BatList.fold_right (fun a b -> a ^ " " ^ b) lst2 ""
        |> Printf.printf "%s\n"