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;


namespace AtCoder
{
    partial class Program
    {
		static int ReadInt()
        {
            return int.Parse(Console.ReadLine());
        }
        static long ReadLong()
        {
            return long.Parse(Console.ReadLine());
        }
		static int[] ReadIntArray()
        {
            return Console.ReadLine().Split(' ').Select(int.Parse).ToArray();
        }
        static long[] ReadLongArray()
        {
            return Console.ReadLine().Split(' ').Select(long.Parse).ToArray();
        }
		
        public class PriorityQueue<T> where T : IComparable
        {
            private IComparer<T> _comparer = null;
            private int _type = 0;

            private T[] _heap;
            private int _sz = 0;

            private int _count = 0;

            /// <summary>
            /// Priority Queue with custom comparer
            /// </summary>
            public PriorityQueue(int maxSize, IComparer<T> comparer)
            {
                _heap = new T[maxSize];
                _comparer = comparer;
            }

            /// <summary>
            /// Priority queue
            /// </summary>
            /// <param name="maxSize">max size</param>
            /// <param name="type">0: asc, 1:desc</param>
            public PriorityQueue(int maxSize, int type = 0)
            {
                _heap = new T[maxSize];
                _type = type;
            }

            private int Compare(T x, T y)
            {
                if (_comparer != null) return _comparer.Compare(x, y);
                return _type == 0 ? x.CompareTo(y) : y.CompareTo(x);
            }

            public void Push(T x)
            {
                _count++;

                //node number
                var i = _sz++;

                while (i > 0)
                {
                    //parent node number
                    var p = (i - 1) / 2;

                    if (Compare(_heap[p], x) <= 0) break;

                    _heap[i] = _heap[p];
                    i = p;
                }

                _heap[i] = x;
            }

            public T Pop()
            {
                _count--;

                T ret = _heap[0];
                T x = _heap[--_sz];

                int i = 0;
                while (i * 2 + 1 < _sz)
                {
                    //children
                    int a = i * 2 + 1;
                    int b = i * 2 + 2;

                    if (b < _sz && Compare(_heap[b], _heap[a]) < 0) a = b;

                    if (Compare(_heap[a], x) >= 0) break;

                    _heap[i] = _heap[a];
                    i = a;
                }

                _heap[i] = x;

                return ret;
            }

            public int Count()
            {
                return _count;
            }

            public T Peek()
            {
                return _heap[0];
            }

            public bool Contains(T x)
            {
                for (int i = 0; i < _sz; i++) if (x.Equals(_heap[i])) return true;
                return false;
            }

            public void Clear()
            {
                while (this.Count() > 0) this.Pop();
            }

            public IEnumerator<T> GetEnumerator()
            {
                var ret = new List<T>();

                while (this.Count() > 0)
                {
                    ret.Add(this.Pop());
                }

                foreach (var r in ret)
                {
                    this.Push(r);
                    yield return r;
                }
            }

            public T[] ToArray()
            {
                T[] array = new T[_sz];
                int i = 0;

                foreach (var r in this)
                {
                    array[i++] = r;
                }

                return array;
            }
        }
        static void Main(string[] args)
        {
			//↓

            var n = ReadInt();
            var alist = ReadIntArray();

            var aa = new List<KeyValuePair<int, int>>(n);
            for (int i = 0; i < n; i++)
            {
                var a = alist[i];
                aa.Add(new KeyValuePair<int, int>(i, a));
            }
            aa.Sort((x, y) => x.Value.CompareTo(y.Value));

            Console.WriteLine(string.Join(" ", aa.Select(a => a.Key + 1)));


			//↑
        }

	}
}