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 Java8 (OpenJDK 1.8.0) (judge verdict: Time Limit Exceeded)

import java.io.*;
import java.util.*;
class Main{
    public static class FastReader {
    
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private SpaceCharFilter filter;
    
        public FastReader(InputStream stream) {
            this.stream = stream;
        }
    
        public int read() {
    
            if (numChars==-1)
                throw new InputMismatchException();
    
            if (curChar >= numChars) {
    
                curChar = 0;
    
                try {
                    numChars = stream.read(buf);
                }
                catch (IOException e) {
                    throw new InputMismatchException();
                }
    
                if(numChars <= 0)
                    return -1;
            }
    
            return buf[curChar++];
        }
    
        public String nextLine() {
    
            BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
            String str = "";
    
            try {
                str = br.readLine();
            }
            catch (IOException e) {
                e.printStackTrace();
            }
    
            return str;
        }
    
        public int nextInt() {
    
            int c = read();
    
            while(isSpaceChar(c))
                c = read();
    
            int sgn = 1;
    
            if (c == '-') {
                sgn = -1;
                c = read();
            }
    
            int res = 0;
    
            do {
                if(c<'0'||c>'9')
                    throw new InputMismatchException();
    
                res *= 10;
                res += c - '0';
                c = read();
            }
            while (!isSpaceChar(c));
    
            return res * sgn;
        }
    
        public long nextLong() {
    
            int c = read();
    
            while (isSpaceChar(c))
                c = read();
    
            int sgn = 1;
    
            if (c == '-') {
                sgn = -1;
                c = read();
            }
    
            long res = 0;
    
            do {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
    
                res *= 10;
                res += c - '0';
                c = read();
            }
    
            while (!isSpaceChar(c));
            return res * sgn;
        }
    
        public double nextDouble() {
    
            int c = read();
    
            while (isSpaceChar(c))
                c = read();
    
            int sgn = 1;
    
            if (c == '-') {
                sgn = -1;
                c = read();
            }
    
            double res = 0;
    
            while (!isSpaceChar(c) && c != '.') {
    
                if (c == 'e' || c == 'E')
                    return res * Math.pow(10, nextInt());
    
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
    
                res *= 10;
                res += c - '0';
                c = read();
            }
    
            if (c == '.') {
    
                c = read();
                double m = 1;
                while (!isSpaceChar(c))
                {
                    if (c == 'e' || c == 'E')
                        return res * Math.pow(10, nextInt());
                    if (c < '0' || c > '9')
                        throw new InputMismatchException();
                    m /= 10;
                    res += (c - '0') * m;
                    c = read();
                }
            }
    
            return res * sgn;
        }
    
        public char nextChar() {
    
            int c = read();
    
            while (isSpaceChar(c))
                c = read();
    
            return (char)c;
        }
    
        public String next() {
    
            int c = read();
    
            while (isSpaceChar(c))
                c = read();
    
            StringBuilder res = new StringBuilder();
    
            do {
                res.appendCodePoint(c);
                c = read();
            }
            while (!isSpaceChar(c));
    
            return res.toString();
        }
    
        public boolean isSpaceChar(int c) {
    
            if (filter != null)
                return filter.isSpaceChar(c);
    
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }
    
        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);
        }
    
    }
    public static void main(String args[]){
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        FastReader in = new FastReader(inputStream);
        PrintWriter w = new PrintWriter(outputStream);
        int n,k,i,c=0,temp;
      	n=in.nextInt();
      int arr[][]=new int[n][2];
      //int co[]=new int[n];
      for(i=0;i<n;i++){
        arr[i][0]=in.nextInt();
        arr[i][1]=++c;
      }
      //Arrays.sort(arr[]);
      for(i=0;i<n;i++){
        for(int j=i+1;j<n;j++){
          if(arr[i][0]>arr[j][0]){
            temp=arr[i][0];
            arr[i][0]=arr[j][0];
            arr[j][0]=temp;
            
            temp=arr[i][1];
            arr[i][1]=arr[j][1];
            arr[j][1]=temp;
          }
        }
      }
      for(i=0;i<n;i++){
        System.out.print(arr[i][1]+" ");
      }
          
        w.close();
    }
}