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.IO;
using System.Linq;
using System.Collections.Generic;
using System.Numerics;

namespace abc142
{
    class Program
    {
        static void Main(string[] args)
        {
            //Console.SetIn(new StreamReader("input.txt"));
            solve_abc142C();
        }

        public static void solve_abc142C()
        {
            int n = Convert.ToInt32(Console.ReadLine());
            
            int[] a = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);

            Dictionary<int, int> dic = new Dictionary<int, int>();

            for (int i = 0; i < n; i++)
            {
                dic.Add(i, a[i]);
            }

            List<KeyValuePair<int, int>> srtList = dic.OrderBy(x => x.Value).ToList();

            for (int i = 0; i < n; i++)
            {
                Console.Write("{0} ", srtList[i].Key + 1);
            }
        }

        public static void solve_abc142B()
        {
            int[] nk = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);
            int n = nk[0];
            int k = nk[1];
            int[] h = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);

            int cnt = 0;

            for (int i = 0; i < n; i++)
            {
                if (h[i] >= k)
                {
                    cnt++;
                }
            }

            Console.WriteLine(cnt);
        }
        public static void solve_abc142A()
        {
            int n = Convert.ToInt32(Console.ReadLine());

            double res = n % 2 == 0 ? (double)(n / 2) / n : ((double)(n / 2) + 1) / n;

            Console.WriteLine("{0:F16}", res);
        }
    }
}