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 (Python):
import sys
from bisect import bisect_right as bsr
from collections import Counter as cnt
from collections import defaultdict as dd
from collections import deque
from fractions import gcd
from itertools import combinations as comb
from itertools import permutations as perm
from math import ceil, factorial, floor
from operator import itemgetter as ig

sys.setrecursionlimit(1000000)


args = None
INF = float("inf")
MOD = int(1e9 + 7)


def input(*ps):
    if type(ps[0]) is list:
        return [input(*ps[0][:-1]) for _ in range(ps[0][-1])]
    elif len(ps) == 1:
        return ps[0](next(args))
    else:
        return [p(next(args)) for p in ps]


def yesno(v, yes="Yes", no="No", upper=False):
    if upper:
        print([yes.upper(), no.upper()][not v])
    else:
        print([yes, no][not v])


def main():
    """エントリーポイント"""
    N = input(int)
    A = input([int, N])

    a = list(zip(A, [x for x in range(1, N + 1)]))
    ans = [str(x[1]) for x in sorted(a)]
    print(" ".join(ans))


if __name__ == '__main__':
    args = iter(sys.stdin.read().split())
    main()

Solution (Python):
N=int(input())
A=list(map(int, input().split()))
ans=[0]*N

for i in range(N):
    k=A[i]
    ans[k-1]=i+1

print(*ans , sep=' ')

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    n = int(input())
    A = list(map(int, input().split()))

    B = []
    for i in range(n):
        B.append([i + 1, A[i]])
    B = sorted(B, key=lambda x: x[1])

    res = []
    for i in range(n):
        res.append(B[i][0])

    print(*res)


if __name__ == '__main__':
    resolve()

Solution (Python):
n = int(input())
a = list(map(int,input().split()))
ans = [0]*n

for i in range(n):
  ans[a[i]-1]=i+1
print(*ans)

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
ans = [0] * N
for i in range(N):
    ans[A[i]-1] = i+1

print(*ans)

Solution (Python):
N = int(input())
D = list(map(int, input().split()))
ans = [0 for i in range(N)]
for i, d in enumerate(D):
    ans[d-1] = i+1
print(' '.join(map(str, ans)))

Solution (Python):
N = int(input())
A = [int(a) for a in input().split()]
B = list(range(1,N+1))

Z = sorted(zip(A, B), key = lambda x: x[0])

print(*list(zip(*Z))[1])

Solution (Python):
N=int(input())
A=[int(x) for x in input().rstrip().split()]
ans=[0 for i in range(N)]
for i in range(len(A)):
  ans[A[i]-1]=i+1
print(*ans)

Solution (Python):
import itertools

n = int(input())

h = list(map(int,input().split()))	
ans = [0]*n
for i in range(n):
    ans[h[i]-1]= i+1

for i in range(n):
    print(ans[i],end=" ")
"""
for i in range(1,n+1):
    
    for j in range(n):
        
        if h[j] == i:
            ans.append(j+1)

for i in range(len(ans)):
    print(ans[i],end=" ")
"""

Solution (Python):
n=int(input())
a=list(map(int,input().split()))
ans=[0]*n

for i in range(n):
  ans[a[i]-1]=i+1
print(*ans)

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
data = []
for i in range(N):
    data.append((A[i], i+1))

data.sort()
answer = []
for ele in data:
    answer.append(str(ele[1]))

print(" ".join(answer))

Solution (Python):
def main():
    n = int(input())
    a = list(map(int, input().split()))     
    turn = [0]*(n+1)

    for index, j in enumerate(a, 1):
        turn[j] = index
    print(*turn[1:], sep=" ")


if __name__ == '__main__':
    main()

Solution (Python):
import numpy as np

N = int(input())
la = list(map(int, input().split()))

ans = np.argsort(la) + 1

print(*ans)

Solution (Python):
N = int(input())
A = list(map(int, input().split()))

dit = {}

for i in range(N):
    dit[i+1] = A[i]

dic2 = sorted(dit.items(), key=lambda x:x[1])

for i in range(N):
    print(dic2[i][0], end=' ')

Solution (Python):
n=int(input())
a=list(map(int,input().split()))
b=[0]*n
for i in range(n):
  b[a[i]-1]+=i+1
c=[str(i) for i in b]
print(" ".join(c))

Solution (Python):
n = int(input())
a_li = list(map(int,input().split()))
res = [ x for x in zip([i+1 for i in range(n)],a_li)]
res.sort(key=lambda x:x[1])
print(' '.join(list(map(lambda x: str(x[0]), res))))

Solution (Python):
n=int(input())
a=list(map(int,input().split()))

d={}

for i in range(n):
  d[a[i]]=i+1

for j in range(1,n+1):
  print(d[j],end=" ")
print()

Solution (Python):
n=int(input())
a=list(map(int,input().split()))
b=list(range(1,n+1))
ab=list(zip(a,b))
ab.sort()
l=(str(ab[i][1]) for i in range(n))
l=list(l)
print(' '.join(l))

Solution (Python):


data = int(input())
qwe = list(map(int,input().split()))
result = [0]*data
for i,a in enumerate(qwe):
    result[a-1] = i+1
print(*result)

Solution (Python):










mod = 10**9 + 7

def readInts():
  return list(map(int,input().split()))
def main():
    n = int(input())
    A = zip(map(int,input().split()), range(1,n+1))
    print(*[a[1] for a in sorted(A)])
if __name__ == '__main__':
  main()

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N = INT()
A = LIST()
a = []

for i in range(0, N):
  a.append([i+1, A[i]])

a.sort(key = lambda x: x[1])  

for i in range(N):
  print(a[i][0],end="")
  print(" ",end="")
  
print()

Solution (Python):
import numpy as np
_ = input()
hoge = np.array(list(map(int, input().split())))

res = ''
for i in np.argsort(hoge):
  res += str(i + 1) + ' '
print(res[:-1])

Solution (Python):
import sys

n, *a = map(int, sys.stdin.read().split())

def main():
    res = [x[0] for x in sorted(enumerate(a, 1), key=lambda x: x[1])]
    print(*res, sep=' ')

if __name__ ==  '__main__':
    main()

Solution (Python):

n = int(input())
nums = [int(i) for i in input().split()]

students = []
for i in range(n):
    students.append((nums[i], i + 1))
students.sort(key=lambda x: x[0])

ans = []
for i in range(n):
    ans.append(students[i][1])
print(*ans)

Solution (Python):
N = int(input())
A = list(map(int,input().split()))
ans = [0]*N

for i in range(N):
    ans[A[i]-1] = i+1

print(' '.join(map(str, ans)))

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
idx = sorted(range(1, N + 1), key=lambda x: A[x - 1])
for i in idx:
    print(i, end=" ")
print("")

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
A_sort = []
for i in range(N):
    A_sort.append((i + 1, A[i]))
A_sort.sort(key=lambda x: x[1])
for i, _ in A_sort:
    print(i, end=" ")

Solution (Python):
def main():
    N = int(input())
    A = sorted([[int(t), i + 1] for i, t in enumerate(input().split())])
    print(' '.join(map(str, [row[1] for row in A])))


if __name__ == '__main__':
    main()

Solution (Python):
n = map(int,input().split())
a = list(map(int,input().split()))

tmp = [[num,i+1] for i,num in enumerate(a)]
tmp.sort(key=lambda x: x[0])

ans = [str(i) for j,i in tmp]

print(" ".join(ans))

Solution (Python):










mod = 10**9 + 7

def readInts():
  return list(map(int,input().split()))
def main():
    n = int(input())
    A = readInts()
    Al = []
    for i in range(n):
        Al.append([A[i],i+1])
    Al = sorted(Al,key = lambda Al:Al[0]) 
    ans = []
    for k,v in Al:
        ans.append(v)
    print(*ans)
if __name__ == '__main__':
  main()

Solution (Python):
n = int(input())
A = list(map(int, input().split()))
rev = [0]*(n)
for i in range(n):
    rev[A[i]-1] = i+1
print(" ".join(map(str, rev)))

Solution (Python):
N = int(input())
a = list(map(int,input().split()))

dic = {}
for i in range(1,N+1):
  dic[i] = a[i-1]
  
dic = sorted(dic.items(),key=lambda x:x[1])
l = [k[0] for k in dic]
print(' '.join(map(str,l)))

Solution (Python):


import sys


















def main():
    mod = 1000000007                  
    inf = float('inf')
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():  return int(input())
    def mi():  return map(int, input().split())
    def mi_0(): return map(lambda x: int(x)-1, input().split())
    def lmi(): return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():  return list(input())
    
    
    n = ii()
    a = lmi()
    d = {}
    for i, accum in enumerate(a):
        d[accum] = i + 1
    for j in range(1, n+1):
        print(d[j], end=' ')
    print('')

if __name__ == "__main__":
    main()

Solution (Python):
n = int(input())
a_inputs = {int(a):i+1 for i,a in enumerate(input().split())}
print(' '.join([str(a_inputs[i]) for i in range(1,n+1)]))

Solution (Python):
n = int(input())
a = list(map(int, input().split()))
l = []
for n, i in enumerate(a,1):
    l.append((i,n))
ans = sorted(l)
for i in range(n):
    print(ans[i][1], end=" ")

Solution (Python):
N=int(input())
A=input().split()
list=[]
for i in range(0,N):
  list.append(0)
for i in range(0,N):
  list[int(A[i])-1]=i+1
for i in range(0,N):
  print(list[i])

Solution (Python):
n=int(input())
a=list(map(int,input().split()))
b=[0]*n
for i in range(n):
  b[a[i]-1]=i+1
b=[str(c) for c in b]
print(" ".join(b))

Solution (Python):

N = int(input())
A = list(map(int, input().split()))
A_sorted =sorted(enumerate(A))


junbann =[(i+1,v) for i,v in enumerate(A) ]
junbann_sort =sorted(junbann,key = lambda x:x[1])
kotae = [i[0] for i in junbann_sort]
print(*kotae)

Solution (Python):

import sys
import numpy as np


def solve(N: int, A: "List[int]"):
    ans = [0]*N
    for i in range(N):
        ans[A[i]-1]=str(i+1)
    print(" ".join(ans))
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    A = [int(next(tokens)) for _ in range(N)]  
    solve(N, A)

if __name__ == '__main__':
    main()

Solution (Python):
n=int(input())
A=list(map(int,input().split()))
B=[0]*n
for i in range(n):
    B[A[i]-1]=i+1
print(*B)

Solution (Python):
n = int(input())
a = list(map(int,input().split()))

ansList = [0]*n

for i in range(n):
  ansList[a[i]-1] = i+1
  
for i in ansList:
  print(i,end=" ")

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
B = [0]*N
for i in range(N):
    B[A[i]-1] = i+1
print(' '.join(map(str, B)))

Solution (Python):
n=int(input())
s=[ int(i) for i in  input().split()]
l=[0]*n

for i in range(n):
  l[s[i]-1]=str(i+1)
print(' '.join(l))

Solution (Python):
n = int(input())
a = list(map(int,input().split()))
ans = [0]*n
for i,j in enumerate(a,start=1):
  ans[j-1] = i
for i in range(n):
  print(ans[i],' ', end='')

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
L = []
T = {}
for i in range(N):
    T[i+1] = A[i]
newT = {v : k for k, v in T.items()}
for i in range(1,N+1):
    L.append(newT[i])
print(*L)

Solution (Python):
n=int(input())
a=[int(i) for i in input().split()]

ans=[0]*n

for i in range(1,n+1):
    ans[a[i-1]-1]=str(i)
    
print(" ".join(ans))

Solution (Python):
n = int(input())
a = list(map(int, input().split()))
import numpy as np
print(" ".join(map(str, list(np.argsort(a) + 1))))

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
result_list = [0]*N
for a, b in enumerate(A):
    result_list[b-1] = a + 1
print(*result_list)

Solution (Python):
N = int(input())
A = list(map(int, input().split()))

d = [[i+1, v] for i, v in enumerate(A)]

d.sort(key = lambda x: x[1])

for i, v in d:
    print(i, end=' ')

print()

Solution (Python):
N = int(input())
A = list(map(int,input().split()))
dic = {i:0 for i in range(1,N+1)}
for i in range(N):
    dic[A[i]] = i + 1
ans = []

for i in dic.keys():
    ans.append(str(dic[i]))
print(' '.join(ans))

Solution (Python):
n = int(input())
a = list(map(int, input().split()))
res = [0] * n
for i,val in enumerate(a):
  res[val-1] = i+1
print(*res)

Solution (Python):
n = int(input())
a = list(map(int, input().split()))

ans = [0] * n

for i in range(n):
    ans[a[i]-1] = i+1

print(*ans)

Solution (Python):
n, *a = map(int, open(0).read().split())

d =[0] * n
for i in range(0, n):
    d[a[i] - 1] = i + 1
    
for i in range(n):
    print(d[i], end=' ')

Solution (Python):
n, *a = map(int, open(0).read().split())

d = {}
for i in range(0, n):
    d[a[i]] = i + 1
    
for i in range(n):
    print(d[i + 1], end=' ')

Solution (Python):
N = int(input())
L = list( map(int,input().split()) )
LL = [0] * N
for i, name in enumerate(L):
    LL[name-1] = i+1

for j in range(N):
    print(LL[j],end=" ")

Solution (Python):
n = int(input())
a = [int(i) for i in input().split()]
l = [0] * n

for i in range(n):
    l[a[i]-1] = str(i+1)

print(' '.join(l))

Solution (Python):
N=int(input())
A=[int(s) for s in input().split(" ")]

Ans=[]
Ans2=[]
for i in range(N):
    Ans=[A[i],i+1]
    Ans2.append(Ans)
    Ans=[]

Ans2.sort()

Ans3=[]
for i in range(N):
    Ans3.append(str(Ans2[i][1]))
    

print((" ").join(Ans3))

Solution (Python):
N=int(input())
A=list(map(int,input().split()))
student={}
for i in range(N):
    student[A[i]]=i+1

for i in range(1,N+1):
    print(student[i],end=" ")

Solution (Python):
n = int(input())
a = list(map(int,input().split()))
ans=[0]*n
for k,i in enumerate(a):
    ans[i-1]=str(k+1)
print(" ".join(ans))

Solution (Python):
N = int(input())
A = tuple(map(int, input().split()))

ans = []

for i, j in enumerate(A):
    ans.append((j, i+1))

ans.sort()

for i, j in ans:
    print(j, end='')
    if i == len(ans):
        print()
    else:
        print(' ', end='')

Solution (Python):
n = int(input())
a = []
i = 1
for j in list(map(int, input().split())):
    a.append((i, j))
    i += 1
a.sort(key=lambda x: x[1])
ans = []
for i, j in a:
    ans.append(str(i))
print(' '.join(ans))

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
nA = []
for i in range(N):
    nA.append([A[i], i + 1])
nA.sort(key=lambda x: x[0])
ans = list(map(list, zip(*nA)))[1]
ans = list(map(str, ans))
print(' '.join(ans))

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
printV = lambda x: print(*x, sep="\n")
printH = lambda x: print(" ".join(map(str,x)))
def IS(): return sys.stdin.readline()[:-1]
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LII(rows_number): return [II() for _ in range(rows_number)]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
mo = 10**9+7

def main():
	n = II()
	a = LI()
	ans=[]
	for i,x in enumerate(a,1):
		ans.append([i,x])
	ans.sort(key=lambda x: x[1])
	printH(row[0] for row in ans)

if __name__ == '__main__':
	main()

Solution (Python):
n = int(input())
a = list(map(int, input().split()))
ans = [0 for i in range(n)]
for i in range(n):
       ans[a[i]-1] = str(i+1)

print(" ".join(ans))

Solution (Python):

import itertools
import numpy as np
import sys
n = int(input())
A= np.array(list(map(int,input().split())))
B = A.argsort()+1

C=' '.join(map(str,list(B)))
print(C)

Solution (Python):
n = int(input())
a = [int(i) for i in input().split()]
b = dict()
for i, ai in enumerate(a):
    b[ai] = i + 1
c = list()
for i in range(n):
    c.append(b[i + 1])
print(*c)

Solution (Python):
def q3():
    N = int(input())
    A = [int(i) for i in input().split()]
    ans = [0] * N
    for i, a in enumerate(A):
        ans[a-1] = i + 1
    print(' '.join([str(i) for i in ans]))


if __name__ == '__main__':
    q3()

Solution (Python):
n = int(input())
A = [int(x) for x in input().split()]
lst = [0] * n
for i, a in enumerate(A, 1):
  lst[a-1] = i
print(*lst)

Solution (Python):

"""
C - Go to School
https://atcoder.jp/contests/abc142/tasks/abc142_c

"""
import sys


def solve(N, students):
    res = sorted([(s, i) for i, s in zip(range(1, N+1), students)])
    ans = [i for _, i in res]
    return ans


def main(args):
    N = int(input())
    students = [int(s) for s in input().split()]
    ans = solve(N, students)
    print(*ans)


if __name__ == '__main__':
    main(sys.argv[1:])

Solution (Python):
n=int(input())
a=list(map(int,input().split()))
ans=[0]*(n)
for i in range(n):
    x=a[i]
    ans[x-1]+=(i+1)
ans2=[str(s) for s in ans]
print(" ".join(ans2))

Solution (Python):
n = int(input())
a = list(map(int, input().split()))
ans = [0]*n
for i in range(n):
    ans[a[i]-1] = i+1
print(*ans)

Solution (Python):
import sys
from operator import itemgetter
def input(): return sys.stdin.readline().rstrip()
def main():
    n=int(input())
    A=[(int(i)+1,int(a)) for i,a in enumerate(input().split())]
    A.sort(key=itemgetter(1))
    print(" ".join(map(str,list(zip(*A))[0])))
if __name__=='__main__':
    main()

Solution (Python):
import sys
from operator import itemgetter
def input(): return sys.stdin.readline().rstrip()
def main():
    n=int(input())
    A=[(int(i),int(a)) for i,a in enumerate(input().split())]
    A.sort(key=itemgetter(1))
    s=""
    for a in A:
        s+=str(a[0]+1)+" "
    print(s)
if __name__=='__main__':
    main()

Solution (Python):

def myAnswer(N:int,A:list) -> int:
   dic ={}
   for i in range(1,N+1):
      dic[i]=A[i - 1]
   ans = sorted(dic.items(), key=lambda x:x[1])
   for a in ans:
      print(a[0],end=" ")
   print()
def modelAnswer():
   tmp=1
def main():
   N = int(input())
   A = list(map(int,input().split()))

   myAnswer(N,A[:])

if __name__ == '__main__':
   main()

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
B = [[A[i], i+1] for i in range(N)]
B = sorted(B, key=lambda x:x[0])
print(*[B[i][1] for i in range(N)])

Solution (Python):
n = int(input())
a = list(map(int,input().split()))
b = [0]*n
for i in range(n):
  b[a[i]-1] = str(i+1)
print(" ".join(b))

Solution (Python):
"""
int(input())
map(int,input().split())
list(map(int,input().split()))

"""

n=int(input())
B=list(map(int,input().split()))
A=[]
for i in range(n):
    A.append([B[i],i+1])
A.sort()
for i in range(n):
    print(A[i][1],end=" ")

Solution (Python):
import numpy as np
N = int(input())
A = np.array(list(map(int, input().split())))
ans = np.argsort(A) + 1
print(' '.join([str(a) for a in ans]))

Solution (Python):
N=int(input())
a=list(map(int, input().split()))
b=[0]*N
c=1
while c<=N:
	d=a[c-1]
	b[d-1]=c
	c+=1
for i in range(N):
	print(b[i])

Solution (Python):
n = int(input())
a = list(map(int, input().split()))
lists = [i for i in range(1, n + 1)]
dicts = {j:i for i, j in zip(lists, a)}
for i in range(1, n + 1):
    print(dicts[i], end=' ')
print()

Solution (Python):
N=int(input())
a=list(map(int,input().split()))
ans=[0]*N
for i in range(N):
	b=a[i]-1
	ans[b]=i+1
for i in range(N):
	print(ans[i])

Solution (Python):
N = int(input())
ary1 = list(map(int,input().split()))
ary2 = sorted([[ary1[i],i+1] for i in range(N)])
[print(x[1],end=" ") for x in ary2]

Solution (Python):
N = int(input())
A = dict(zip(map(int, input().split()), [i for i in range(1, N+1)]))

for i in range(1, N + 1):
    print(A[i], end=' ')

Solution (Python):
N = int(input())
A = list(map(int,input().split()))
num = {}
ans = []
for i in range(1,len(A)+1):
    num[A[i-1]]=i
num = sorted(num.items())
for k,v in num:
    ans.append(str(v))
print(' '.join(ans))

Solution (Python):
N = int(input())
A = list(map(int, input().split(' ')))

students = [None] * N

for i, a in enumerate(A):
    students[a - 1] = str(i + 1)

print(' '.join(iter(students)))

Solution (Python):
n = int(input())
A = list(map(int, input().split(' ')))
B = []
i = 0
while i < n:
    B.append((A[i],i+1))
    i += 1
B.sort()
ans = ''
for b in B:
    ans += str(b[1]) + ' '
print(ans)

Solution (Python):
n = int(input())
aa = list(map(int, input().split()))
aaa = sorted([(aa[i], i + 1) for i in range(n)])
print(' '.join(map(str, [a[1] for a in aaa])))

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
ans = [x[1] for x in sorted([(a, i + 1) for i, a in enumerate(A)])]
print(" ".join(map(str, ans)))

Solution (Python):
N = int(input())
A = list(map(int, input().split()))

ans = [0] * N
for i in range(N):
    ans[A[i]-1] = i+1
print(*ans)

Solution (Python):
import math

n = int(input())
aLi = list(map(int, input().split(" ")))
sLi = list(range(n))

for i, a in enumerate(aLi):
    sLi[a - 1] = str(i + 1)

print(" ".join(sLi))

Solution (Python):
n = int(input())
l = list(map(int, input().split()))

ans = [0]*n
for a in list(enumerate(l)):
  a = list(a)
  ans[a[1]-1] = a[0]+1

for _ in ans:
  print(_, ' ', end='')

Solution (Python):
N = int(input())
A = input().split()
A = [[int(A[i]),i+1] for i in range(N)]

A = sorted(A)

L = [str(x[1]) for x in A]

print(" ".join(L))

Solution (Python):
n = int(input())
a = list(map(int, input().split()))

ans=[0]*n

for i in range(n):
    ans[a[i]-1]=i+1

for i in range(n):
    print(ans[i], end=" ")

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
a = [0]*N
for i in range(N):
    a[A[i]-1] = str(i+1)
print(' '.join(a))

Solution (Python):
def ri(): return int(input())
def rli(): return list(map(int, input().split()))
def rls(): return list(map(str, input().split()))
def pl(a): print(" ".join(list(map(str, a))))
def ma():return map(int,input().split())
def nli(x):return [input for _ in range(x)]
def hukusuu(): 
  listA=[] 
  while True:
    try:listA.append(list(map(int,input().split())))
    except:break 
  return listA
from itertools import accumulate as acc 
import operator as op
import copy as cp
import math
from bisect import bisect_left as bisl
from bisect import bisect_right as bisr
def ifif(s):
  if s:print("Yes")
  else:print("No")

n=ri()  
a=rli()
b=[0]*n
for k in range(len(a)):
  b[a[k]-1]=str(k+1)

print(" ".join(b))

Solution (Python):
N = int(input())
List = list(map(int, input().split()))
Ans = [0 for _ in range(N)]
for i in range(N):
  Ans[List[i]-1] = str(i+1)
a =' '.join(Ans)
print(a)

Solution (Python):



from collections import Counter

def ri():
    return int(input())

def rl():
    return list(input().split())

def rli():
    return list(map(int, input().split()))

def main():
    n = ri()
    la = rli()
    lb = []
    for i in range(n):
        lb.append((la[i],i))
    lb.sort()
    for b in lb:
        print(b[1]+1)


if __name__ == '__main__':
    main()

Solution (Python):


N=int(input())
A=list(map(int,input().split()))


B=[0 for i in range(N)]

for i in range(N):
    B[A[i]-1]=i+1
    

for i in B:
    print(i,end=" ")

Solution (Python):
def main():
    n = int(input())
    a = list(map(int, input().split()))
    ans = [k[0] for k in sorted({i:ai for i, ai in enumerate(a, 1)}.items(), key=lambda x: x[1])]
    print(*ans)

if __name__ == "__main__":
    main()

Solution (Python):
N=int(input())
A=list(map(int,input().split()))
ans=[0]*N
for i in range(N):
  ans[A[i]-1]=i+1
print(*ans)

Solution (Python):
N=int(input())
A=list(map(int,input().split()))
ans=[0]*N
for i in range(N):
  ans[A[i]-1]=i+1
print(*ans)

Solution (Python):
N = int(input())
A = list(map(int, input().split()))


C = [0]*N

for k in range(N):
    C[A[k]-1] = str(k+1)
    


L = ' '.join(C)
print(L)

Solution (Python):
n= int(input())
a= [int(x) for x in input().split()]
ans= [0 for _ in range(n)]
for i in range(n):
    ans[a[i]-1] = i+1
print(*ans)

Solution (Python):
n = int(input())
l = [0]*n
a = list(map(int, input().split()))


for i, j in enumerate(a):
    l[j - 1] = i + 1

print(*l)

Solution (Python):
n = int(input())
l = [[0]*2 for _ in range(n)]
a = list(map(int, input().split()))


for i in range(n):
    l[i][0] = a[i]
    l[i][1] = i

l.sort()

for i in range(n):
    print(l[i][1] + 1, end=" ")

Solution (Python):
N = int(input())
A = [int(x) for x in input().split()]
B = [0 for _ in range(N)]
for i in range(N):
    B[A[i]-1] = i+1
print(*B)

Solution (Python):
import numpy as np
N = int(input())
A = [int(x) for x in input().split()]

tmp = [x for x in zip(A, range(1, N+1))]
tmp = np.array(sorted(tmp))
print(*tmp[:,1])

Solution (Python):
N = int(input())
A = list(map(int, input().split()))

ans = [0] * N

for i in range(N):
    n = A[i]
    ans[n - 1] = i + 1
    
print(*ans)

Solution (Python):
N = int(input())
A = list(map(int, input().split())) 

ans = [0] * N

for i in range(N):
    num = A[i]
    ans[num-1] = i + 1

print(*ans)

Solution (Python):
n = int(input())
a = list(map(int, input().split()))

cnt = [0] * n
for i in range(n):
    x = a[i]
    cnt[x-1] = i+1
print(*cnt)

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
A = sorted([(a, i) for i, a in enumerate(A)])
print(*[i+1 for _, i in A])

Solution (Python):
n = int(input())
a = list(map(int,input().split()))

ans = [0 for _ in range(n)]

for i in range(n):
    ans[a[i] - 1] = i + 1
print(*ans)

Solution (Python):
N = int(input())
A = list(map(int, input().split()))

answer = [0] * N
for i, Ai, in enumerate(A):
    answer[Ai - 1] = str(i + 1)
answer = ' '.join(answer)

print(answer)

Solution (Python):
n = int(input())
a = [int(i) for i in input().split()]
out = [0] * n
for i in range(len(a)): out[a[i] - 1] = i + 1
print(' '.join([str(i) for i in out]))

Solution (Python):
N = int(input())
A = list(map(int,input().split()))

a_l = [0] * N

for i,v in enumerate(A):
    a_l[v-1] = i + 1

print(*a_l)

Solution (Python):
n = int(input())
A= list(map(int,input().split()))
ls = list(enumerate(A))
ls.sort(key = lambda x:x[1])
ans = []
for idx,a in ls:
    ans.append(idx+1)
print(*ans)

Solution (Python):
n=int(input())
a=list(map(int,input().split()))
ans=[0]*n
for i in range(n):
    ans[a[i]-1]=i+1
print(*ans)

Solution (Python):
n = int(input())
ns = map(int, input().split())
dic = {}
for index, num in enumerate(ns):
    dic[str(index+1)] = num
print(' '.join(str(i) for i,j in sorted(dic.items(), key=lambda x:x[1])))

Solution (Python):
n = int(input())
s = list(map(int,input().split()))
num = list(i+1 for i in range(n))
tp = list(zip(s,num))
tp1 =[]
for i in tp :
  tp1.append(list(i))
tp1 = sorted(tp1)
tp1 =[tp1[i][1] for i in range(n)]
print(*tp1)

Solution (Python):
n=int(input())
a=list(map(int,input().split()))
dic={}
for i in range(1,n+1):
  dic[a[i-1]]=i
sorted_dict=sorted(dic.items(), key=lambda x:x[0])
ans=""
for i in range(n):
  ans+=str(sorted_dict[i][1])+" "
print(ans)

Solution (Python):
n = int(input())
a = [int(i) - 1 for i in input().split()]
ans = [-1 for _ in range(n)]
for i in range(n):
  ans[a[i]] = i
for i in range(n):
  print(ans[i] + 1, end=" ")

Solution (Python):
import numpy as np
n = int(input())
lis = np.array(list(map(int, input().split())))
lis2 = np.argsort(lis).tolist()
for i in range(n):
    print(lis2[i]+1, end=' ')

Solution (Python):
n = int( input() )
l = map( int, input().split() )

attendance_list = [0] * n
cnt = 1
for i in l:
  attendance_list[ i - 1 ] = cnt
  cnt += 1
alist = str( attendance_list[0] )
for a in attendance_list[1:]:
  alist += " " + str( a )
print( alist )

Solution (Python):
from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect



import numpy as np
from fractions import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial, log, log10, log2
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')
from datetime import datetime as dt

def main():
  n = int(readline())
  A=list(map(int, readline().split()))
  B = [0]*n
  for shusseki, rank in enumerate(A):
    B[rank-1] = shusseki + 1
  print(' '.join(map(str, B)))
  
  
  
  
if __name__ == '__main__':
  main()

Solution (Python):
N = int(input())
An = list(map(int, input().split()))
ans = [0 for _ in range(N)]
for i in range(N):
    ans[An[i]-1] = i+1
print(*ans)

Solution (Python):
n = int(input())

a = list(map(int, input().split()))

uoo = {}

cnt = 1
for i in a:
    uoo[i] = cnt

    cnt += 1


ans = ''

for j in range(1,n+1):
    if j == 1:
        ans += str(uoo[j])
    else:
        ans += ' '
        ans += str(uoo[j])

print(ans)

Solution (Python):
n=int(input())
a=list(map(int,input().split()))
ans=[0]*n
for i in range(n):
    ans[a[i]-1]=i+1
print(" ".join(map(str,ans)))

Solution (Python):
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
def ism():return map(str,input().split())
def isl():return list(map(str,input().split()))
n = ii()
A = iil()
ans = [0]*n
for i,item in enumerate(A):
    ans[item-1] = i+1

for i in ans:
    print(i,end=' ')

Solution (Python):
N=int(input())
A=list(map(int,input().split()))
count=0
stu=[0]*N
for i in A:
    count+=1
    stu[i-1]=count
print(*stu)

Solution (Python):
N=int(input())
A=list(map(int,input().split()))
ans=[0]*N
for i in range(N):
    ans[A[i]-1]=i+1
print(*ans)

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    
    from itertools import combinations, permutations, accumulate, groupby
    
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    

    
    

    n = int(input())
    a = list(map(int, input().split()))
    res = []
    for i, x in enumerate(a):
        res.append([x, i])
    res.sort()
    ans = []
    for x, i in res:
        ans.append(i+1)
    print(" ".join(map(str,ans)))

if __name__ == '__main__':
    main()