gotoschool_ex

NeeNawAmbulance stayed up too late to play Factorio last night and will be late for school, so he has made Potato a CEC to help him account for the N students in his class. The students have distinct register numbers from 1 to N.

Today, all the students entered the classroom at different times. According to Potato's record, there were Ai 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.

Note

As this problem deals with large inputs and outputs, you are strongly advised to insert these 2 lines of code at the start of your main() function:

ios_base::sync_with_stdio(false); cin.tie(NULL);

Input

The first line contains one integer, N.

The following line contains N integers, A1 to AN.

Output

Output the student numbers of the students in the order the students entered the classroom.

Constraints

  • 1 ≤ N ≤ 5 × 106
  • 1 ≤ AiN
  • Ai are unique.

Sample Input 1

3
2 3 1

Sample Output 1

3 1 2

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

Submitting to 'gotoschool_ex'


You're not logged in! Click here to login


Submitting to 'gotoschool_ex'


You're not logged in! Click here to login


Submitting .cpp to 'gotoschool_ex'


You're not logged in! Click here to login

Time Limit: 1.2 Seconds
Memory Limit: 1024MB
Your best score: 0
Source: RI November Course 2023 Diagnostic Test (NeeNawAmbulance, nianhe)

Subtask Score
1 0
2 40
3 60