You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.

Background

Description

离散化基础。用结构体（struct）来对整数的排序，并把其排序的结点序号（以1为开始）打印出来。 输入样例：第1行，一个整数N，范围在[1...10000]；第2行，有N个不相同的整数，每个整数都是int范围的。 输出样例：4 1 3 5 2

Format

Input

Output

Samples

5
8 2 6 9 3

4 1 3 5 2

Limitation

1s, 1024KiB for each test case.