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 C# (Mono 4.6.2.0) (judge verdict: Accepted)

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
#if DEBUG
using Console = Atcoder.Helper.HelperConsole;
using AtcoderHelper = Atcoder.Helper.AtcoderHelper;
#endif

namespace Atcoder
{
    public class Program
    {
        public static void Main(string[] args)
        {
#if DEBUG
            var url = @"
https://atcoder.jp/contests/abc142/tasks/abc142_b
";
            AtcoderHelper.RunTestCases(url);
        }
        public static void Code()
        {
#endif
            var n = int.Parse(Console.ReadLine());
            var a = Console.ReadLine().Split(' ').Select(int.Parse).ToArray();
            var pair = a.Select((x, i) => new Pair() { X = x, I = i }).ToList();
            pair.Sort(new Comp());
            var ans = string.Join(" ", pair.Select(p => p.I + 1).ToArray());
            Console.WriteLine(ans);
        }

        class Comp : IComparer<Pair>
        {
            public int Compare(Pair x, Pair y)
            {
                if(x.X == y.X) { return 0; }
                return x.X > y.X ? 1 : -1;
            }
        }

        struct Pair
        {
            public int X;
            public int I;
        }
    }
}