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 Go (1.6) (judge verdict: Accepted)

package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

var sc = bufio.NewScanner(os.Stdin)

func inputInt() int {
	sc.Scan()
	i, e := strconv.Atoi(sc.Text())
	if e != nil {
		panic(e)
	}
	return i
}

func splitInt(n int) []int {
	arr := make([]int, n)
	for i := 0; i < n; i++ {
		arr[i] = inputInt()
	}
	return arr
}

type sortable [][]int

func (s sortable) Len() int { return len(s) }

func (s sortable) Less(i, j int) bool { return s[i][0] < s[j][0] }

func (s sortable) Swap(i, j int) { s[i], s[j] = s[j], s[i] }

func main() {
	sc.Split(bufio.ScanWords)
	n := inputInt()
	as := splitInt(n)
	ans := make([]int, n)
	for i := 0; i < n; i++ {
		ans[as[i]-1] = i + 1
	}

	first := true
	for _, x := range ans {
		if !first {
			fmt.Print(" ")
		}
		fmt.Printf("%d", x)
		first = false
	}
}