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



Sample input:
3
2 3 1


Sample output:
3 1 2

Submission status: Time Limit Exceeded

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

ans = [str(a.index(x)+1) for x in range(1, n+1)]

print(" ".join(ans))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = [int(x) for x in input().split()]

ans = [str(a.index(x)+1) for x in range(1, n+1)]

print(" ".join(ans))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
A = list(map(int, input().split()))

ans = [0] * n

for i in range(n):
    ans[i] = A.index(min(A)) + 1
    A[A.index(min(A))] = n + 1
    
print(' '.join(map(str, ans)))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
A = list(map(int, input().split()))

ans = [0] * n

for i in range(n):
    ans[i] = A.index(i+1) + 1
print(' '.join(map(str, ans)))

Submission status: Time Limit Exceeded

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

ans = ""
for i in range(1, N + 1):
  ans += str(A.index(i) + 1) + " "
print(ans)

Submission status: Time Limit Exceeded

Solution code:
#abc142C_go to school
N = int(input())
A = list(map(int, input().split()))
ans = []*N 
for i in range(1,N+1):
    ans.insert(i-1,A.index(i)+1)    
print(*ans)

Submission status: Time Limit Exceeded

Solution code:
#abc142C_go to school
N = int(input())
A = list(map(int, input().split()))
ans = [] 
for i in range(1,N+1):
    ans.append(A.index(i)+1)    
print(*ans)

Submission status: Time Limit Exceeded

Solution code:
#abc142C_go to school
N = int(input())
A = list(map(int, input().split()))
for i in range(1,N+1):
    print(A.index(i)+1,end=' ')

Submission status: Time Limit Exceeded

Solution code:
#abc142C_go to school
N = int(input())
A = list(map(int, input().split()))
cnt =1
while cnt < N+1:
    for i in range(N):
        if A[i] == cnt:
            print(i+1,end=' ')
            cnt +=1
            break

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
An = list(map(int, input().split()))
order = []

for i in range(N):
    print( An.index(i+1)+1 ,end=" ")

Submission status: Time Limit Exceeded

Solution code:
a=input()
b=input()

N=int(a)
An = [int(b0) for b0 in b.split(' ')]

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

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
a=(input().split())
a1={}
for i in range(n):
    a1[(a[i])]=i+1
#print(a1)    
str1=""
for i in range(n):
    a2=str(i+1)
#    print(a2)
    str1=str1 + " " + str(a1[a2])
print(str1)

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
a=(input().split())
a1=[]
for i in range(n):
    a1.append(int(a[i]))
    
str1=""
for i in range(n):
    for ii in range(n):
        if i+1 == int(a[ii]):
            str1=str1 + " " +str(ii+1)
            break
print(str1)

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
#a=map(int,input().split())
a=(input().split())
#print(a)
a1=[]
for i in range(n):
    a1.append(int(a[i]))
#print(a1)
    
str1=""
for i in range(n):
    for ii in range(n):
        if i+1 == int(a[ii]):
            str1=str1 + " " +str(ii+1)
print(str1)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
l = input().split()

ans_list = []

for i in range(1, N+1):
  ans_list.append(str(l.index(str(i))+1))

l = " ".join(ans_list)
  
print(l)

Submission status: Time Limit Exceeded

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

res = list()
for rank in range(1,n+1):
    for i,v in enumerate(a):
        if v == rank:
            res.append(i+1)

res2 = [str(k) for k in res]
res2 = " ".join(res2)
print(res2)

Submission status: Time Limit Exceeded

Solution code:
import numpy as np
n = int(input())
#a = np.array(list(map(int, input().split())))
a = list(map(int, input().split()))

d = {a.index(i)+1: i for i in a}
#print(d)
d_sorted = sorted(d.items(), key=lambda x:x[1])
#print(d_sorted)
for i in d_sorted:
  print(i[0], end=' ')

Submission status: Time Limit Exceeded

Solution code:
import numpy as np
n = int(input())
#a = np.array(list(map(int, input().split())))
a = list(map(int, input().split()))

d = {a.index(i)+1: i for i in a}
#print(d)
d_sorted = sorted(d.items(), key=lambda x:x[1])
#print(d_sorted)
for i in d_sorted:
  print(i[0], end=' ')
'''
#sorted_a = np.sort(a)
#print(sorted_a)
print(a)
for i in range(n):
  #print(min(a))
  print((a.index(min(a)) + 1))
  a.remove(min(a))
  '''
  
'''
inds = [i for i in range(n)]
sorted_inds = sorted(inds)
print('sorted_inds={}'.format(sorted_inds))
sorted_a = [a[i] for i in sorted_inds]
for i in sorted_a:
  print(i, end=' ')
'''

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
a=list(map(int,input().split()))
aa=[0]*n
for i in range(n):
    aa[a[i]-1]=i+1
kk=''
for i in aa:
    kk=kk +str(i) + ' '
print(kk)

'''
p,m=map(int,input().split())
s=bin(p)
s=s[2:]
n=len(s)


ans=pow(2,n) -1
if(m>=2):
    print(ans)
else:
    print(p)


m,n=map(int,input().split())
a=[False]*(n+1)
a[0]=True
for i in range(m):
    temp=list(map(int,input().split()))
    for kk in temp[1:]:
        a[kk]=True
ans=True
for nn in a:
    ans = nn and ans
if(ans):
    print("YES")
else:
    print("NO")



y,b,r = map(int,input().split())

if(r>b):
    if(b>y):
        print(int((3*y)+3))
    else:
        print(int(3*b))
else:
    if(b<y):
        print(int((3*y)-3))
    else:
        print()


  '''

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
l1=[int(x) for x in input().split()]
l2=[]
for i in range(1,len(l1)+1):
    l2.append(l1.index(i)+1)
for i in l2:
    print(i,end=' ')

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = list(map(int, input().split()))
b = []
for i in range(n):
  b.append(a.index(i+1)+1)
print(" ".join(map(str, b)))

Submission status: Time Limit Exceeded

Solution code:

inputA =  list(map(int,input().split()))
inputB =  list(map(int,input().split()))


anser = []

for i in range(1,inputA[0]+1):
    for j in range(0,inputA[0]):
        if inputB[j] == i:
            anser.append(j+1)
            break

print(*anser)

Submission status: Time Limit Exceeded

Solution code:

inputA =  list(map(int,input().split()))
inputB =  list(map(int,input().split()))


anser = []

for i in range(1,inputA[0]+1):
    for j in range(0,inputA[0]):
        if inputB[j] == i:
            anser.append(j+1)
         

print(*anser)

Submission status: Time Limit Exceeded

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

ans=""
for i in range(1, n+1):
  ans = ans + str(a.index(i)+1) + " "
  
print(ans.strip())

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
A=list(map(int,input().split()))
ans=[]
for j in range(1,N+1):
    for i in range(N): 
        if A[i]==j:
            ans.append(i+1)
print(*ans)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A =[int(x) for x in input().split()]
ans = []

for i in range(N):
  for j in range(N):
    if i+1 == A[j]:
      ans.append(str(j+1))
      break;
L = ' '.join(ans)
print(L)

Submission status: Time Limit Exceeded

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

for i in range(n):
  b[i] = a.index(i+1)+1
  
  
print(*b)

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

for i in range(1, n+1):
  b[i-1] = a.index(i)+1
  
  
print(*b)

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = list(map(int, input().split()))
b = []

for i in range(1, n+1):
  b.append(a.index(i)+1)
  
  
print(" ".join(map(str, b)))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = list(map(int, input().split()))
ans = [str(a.index(i)+1) for i in range(1,n+1) ]
print(' '.join(ans))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = list(map(int, input().split()))
for i in range(1,n+1):
  print(a.index(i)+1, end = " ")

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int,input().split()))
S = []
for i in range(1,N+1):
    S.append(A.index(i)+1)
print(*S)

Submission status: Time Limit Exceeded

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

for i in range(n):
    print(str(a.index(i+1) + 1), end=" ")

Submission status: Time Limit Exceeded

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

s = [0]*n

for i in range(n):
    s[i] = str(a.index(i+1) + 1)
print(" ".join(s))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = list(map(int,input().split()))
ans=[]
for j in range(n):
  for idx,num in enumerate(a):
    if num==j+1:
      ans.append(idx+1)

print(*ans)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
ai = list(map(int, input().split()))

ans = []
for i in range(1, n+1):
    ans.append(ai.index(i)+1)
ans = map(str, ans)
print(" ".join(ans))

Submission status: Time Limit Exceeded

Solution code:
def main():
    N = int(input())
    a = input().split(" ")
    L = []
    for i in range(N):
        L.append("")
    for i in range(N):
        L[int(a[i]) - 1] = str(i + 1)
    ans = ""
    for l in L:
        ans = ans + l + " "
    print(ans[:-1])


if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

Solution code:
def main():
    N = int(input())
    a = input().split(" ")
    dict = {}
    for i in range(N):
        dict[int(a[i])] = str(i + 1)
    ans = ""
    for j in range(N):
        ans = ans + dict[j + 1] + " "
    print(ans)


if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

Solution code:
def main():
    N = int(input())
    a = input().split(" ")
    list = []
    for i in range(N):
        list.append([int(a[i]), i + 1])
    list.sort()
    ans = ""
    for i in list:
        ans = ans + str(i[1]) + " "
    print(ans[:len(ans) - 1])


if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

Solution code:
def main():
    N = int(input())
    a = input().split(" ")
    dict = {}
    for i in range(N):
        dict[int(a[i])] = str(i + 1)
    dict_sorted = sorted(dict.items(), key=lambda x:x[0])
    ans = ""
    for i in dict_sorted:
        ans = ans + i[1] + " "
    print(ans[:len(ans) - 1])


if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

Solution code:
import sys

N = int(sys.stdin.readline())
A = list(map(int, sys.stdin.readline().split()))

ans = [None]*N
for i in range(1, N+1):
        ans[i-1] = A.index(i) + 1
print(" ".join(map(str, ans)))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
tm = list(map(int, input().split()))
li = list()
count = 1
for i in tm:
    li.append((i, count))
    count = count + 1
li.sort()
ans = ''
for l in li:
    ans = ans + ' ' + str(l[1])
print(ans[1:])

Submission status: Time Limit Exceeded

Solution code:
import sys

N = int(sys.stdin.readline())
A = list(map(int, sys.stdin.readline().split()))

ans = [0]*N
for i in range(1, N+1):
        ans[i-1] = A.index(i) + 1
print(" ".join(map(str, ans)))

Submission status: Time Limit Exceeded

Solution code:
import sys

N = int(sys.stdin.readline())
A = sys.stdin.readline().split()
for i in range(N):
        A[i] = int(A[i])

ans = [0]*N
for i in range(1, N+1):
        ans[i-1] = A.index(i) + 1
print(" ".join(map(str, ans)))

Submission status: Time Limit Exceeded

Solution code:
import sys

N = int(sys.stdin.readline())
A = sys.stdin.readline().split()
for i in range(N):
        A[i] = int(A[i])

ans = [0]*N
for i in range(1, N+1):
        for j in range(N):
                if(A[j] == i):
                        ans[i-1] = j+1
print(" ".join(map(str, ans)))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int, input().split()))
ans = [0]*N
for i in range(1, N+1):
        for j in range(N):
                if(A[j] == i):
                        ans[i-1] = j+1
print(" ".join(map(str, ans)))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
tm = list(map(int, input().split()))
li = list()
count = 1
for i in tm:
    li.append((i, count))
    count = count + 1
li.sort()
ans = ''
for l in li:
    ans = ans + ' ' + str(l[1])
print(ans[1:])

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
li = list(map(int,input().split()))
ans =[]
for i in range(n):
    ans.append(str(li.index(i+1)+1))
print(' '.join(ans))

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
a=input().split()
ans=''
for i in range(1,n+1):
    ans+=str(a.index(str(i))+1)+' '

print(ans)

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
a=list(map(int,input().split()))
ans=''
for i in range(1,n+1):
    ans+=str(a.index(i)+1)+' '

print(ans)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A_i = list(map(int, input().split()))

B_i = []

for i in range(1, N + 1):
    B_i.append(str(A_i.index(i) + 1))

print(" ".join(B_i))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
S = list(map(int,input().split()))
for i in range(N):
	print(S.index(i+1)+1 ,end=" ")

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
s=list(map(int,input().split()))
for i in range(1,(n+1)):
    print((s.index(i)+1),end=" ")

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
s=list(map(int,input().split()))
ans=[str(s.index(i)+1) for i in range(1,(n+1))]
print(' '.join(ans))

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
s=list(map(int,input().split()))
ans=''
for i in range(1,(n+1)):
    ans+=str(s.index(i)+1)
    ans+=' '
print(ans)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int, input().split()))
for i in range(1,N+1):
    for j in range(0,N):
        if i == A[j]:
            print(j+1,end=" ")

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int,input().split()))
for n in range(N):
    print(A.index(n+1)+1,end = " ")

Submission status: Time Limit Exceeded

Solution code:
n1 = int(input())
l1 = [int(x) for x in input().split()]
l2 = [""] * n1

for i, v in enumerate(l1):
  l2[v -1] = i + 1

ans = ""
for i in l2:
  ans = ans + str(i) + " "
print(ans[:-1])

Submission status: Time Limit Exceeded

Solution code:
N = int(input())

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

B = [0]*N

for i in A:
    B[i-1] = A.index(i)+1

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

Submission status: Time Limit Exceeded

Solution code:
N = int(input())

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

for i in range(N):
    print(A.index(i+1)+1,end=" ")

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = list(map(int, input().split()))
b = []

for i in range(1, n+1):
  b.append(a.index(i)+1)

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

Submission status: Time Limit Exceeded

Solution code:
i=int(input())
s=input().split()
a=""
for k in range(i-1):
  a+=str(s.index(str(k+1))+1)+" "
a+=str(s.index(str(i))+1)
print(a)

Submission status: Time Limit Exceeded

Solution code:
i=int(input())
s=input().split()
ls=[0]*i
for k in range(i):
  ls[int(s[k])-1]=k+1
a=""
for k in range(i-1):
  a=a+str(ls[k])+" "
a=a+str(ls[i-1])
print(a)

Submission status: Time Limit Exceeded

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


for i in range(n):
  print(1+a.index(i+1),end=" ")

Submission status: Time Limit Exceeded

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


for i in range(len(a)):
  print(1+a.index(i+1),end=" ")

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
a= list(map(int, input().split())) 
#a.sort()
#print(a)
#print(sum(a[:-1])+a[-1]//2)
b=sorted(a)
for i in range(len(a)):
  print(a.index(b[i])+1,end=" ")

Submission status: Time Limit Exceeded

Solution code:
a=int(input())
n=list(map(int,input().split()))
k=[]
for i in range(a):
    for j in range(a):
        if (i+1)==n[j]:
            k.append(j+1)
            break
print(*k)

Submission status: Time Limit Exceeded

Solution code:
a=int(input())
n=list(map(int,input().split()))
k=[]
for i in range(a):
    for j in range(a):
        if (i+1)==n[j]:
            k.append(j+1)
print(*k)

Submission status: Time Limit Exceeded

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


for i in range(1,n+1):
    print(str(a.index(i)+1), end=' ')

Submission status: Time Limit Exceeded

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

order = []


for i in range(1,n+1):
    order.append(str(a.index(i)+1))
    


print(' '.join(order))

Submission status: Time Limit Exceeded

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

order = []


for i in range(1,n+1):
    order.append(a.index(i)+1)
    

for i in range(n):
    order[i] = str(order[i])

print(' '.join(order))

Submission status: Time Limit Exceeded

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

order = []


for i in range(1,n+1):
    order.append(a.index(i)+1)
    

print(' '.join([str(i) for i in order]))

Submission status: Time Limit Exceeded

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

def find(target, list):
    for i in range(len(list)):
        if list[i] == target:
            return i+1

out = []
for j in range(1, n+1):
    out.append(find(j, a))

print(" ".join(map(str, out)))

Submission status: Time Limit Exceeded

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

out = [a.index(s)+1 for s in range(1, n+1)]
print(" ".join(map(str, out)))

Submission status: Time Limit Exceeded

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

for s in range(1, n+1):
    print(a.index(s) + 1, end=" ")

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
A = list(map(int, input().split()))

B = ""
for i in range(1,n+1):
    B += str(A.index(i)+1)+" "
print(B[:-1])

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = list(map(int, input().split()))
f = [i for i in range(1, n+1)]

for i in f:
    print(a.index(i)+1, end=' ')

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = list(map(int, input().split()))
b = []
for i in range(1,n+1):
    b.append(a.index(i)+1)
b =map(str,b)
print(" ".join(b))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = [int(i) for i in input().split()]

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

print(*ans)

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
l=list(map(int,input().split()))
for i in range(1,n+1):
    print(l.index(i)+1,end=' ')

Submission status: Time Limit Exceeded

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

print(' '.join(list(map(str,toko))))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())

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

for i in range(n):
    print(str(a.index(i+1)+1) + " ",end = "")

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int,input().split()))
S = []
for i in range(1,N+1):
    S.append(A.index(i)+1)
print(*S)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int,input().split()))
S = []
for i in range(1,N+1):
    for j in range(N):
        if i == A[j]:
            S.append(j+1)
print(*S)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int, input().split()))
ans_list = []

for i in range(N):
    num = A.index(i+1)
    ans_list.append(str(num+1))
    
print(" ".join(ans_list))

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
l=list(map(int,input().split()))
d=[x+1 for x in range(n)]
for i in d:
  print(l.index(i)+1)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())

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

B = []

for i in range(N+1):
    for j in range(N):
        if A[j] == i:
            B.append(j+1)
            break

print(" ".join(map(str, B)))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = list(map(int, input().split()))
new_a = []

for i in range(len(a)):
    new_a.append(str(a.index(i+1)+1))
    
print(" ".join(new_a))

Submission status: Time Limit Exceeded

Solution code:
#!/usr/bin/env python3
import sys


def solve(N: int, A: "List[int]"):
    lists = []
    for i in range(1, N+1):
        lists.append(str(A.index(i)+1))
    print(" ".join(lists))
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    A = [int(next(tokens)) for _ in range(N)]  # type: "List[int]"
    solve(N, A)

if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = list(map(int, input().split()))
result = []

for i in range(1, n+1):
  result.append(a.index(i) + 1)

print(*result)

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
A=input().split()

j=1
result=[]
while j<=N:
    for i in range(len(A)):
        if int(A[i])==j:
            result.append(i+1)
            j+=1

print(*result)

Submission status: Time Limit Exceeded

Solution code:
import numpy as np
N=int(input().strip())
A=np.array(list(map(int,input().strip().split())))
for i in range(N):
    print(np.argsort(A)[i]+1,end=" ")

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = list(map(int,input().split()))
a_new = sorted(a)
answer = []
for j in range(1,n+1):
  answer.append(a.index(j)+1)
print(*answer)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = list(map(int,input().split()))
a_new = sorted(a)
answer = []
for j in a_new:
  answer.append(a.index(j)+1)
print(*answer)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(int(x) for x in input().split())
for i in range(N):
    minimum = A.index(i+1)
    print(minimum+1, end=" ")

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
L=list(map(int,input().split()))
ans=[]
for i in range(1,n+1):
    ans.append(str(L.index(i)+1))
print(' '.join(ans))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = [int(_) for _ in input().split()]

X = [str(A.index(i)+1) for i in range(1, N+1)] 
print(" ".join(X))

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
A=list(map(int,input().split()))
s=[]
for i in range(1,n+1):
    s.append(A.index(i)+1)
print(*s)

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
A=list(map(int,input().split()))
s=""
for i in range(1,n+1):
    s += str(A.index(i)+1) + " "
print(s.strip(" "))

Submission status: Time Limit Exceeded

Solution code:
import numpy as np

N = int(input())
L = list(map(int, input().split()))
X = []
for i in range(len(L)):
    X.append(L.index(i+1)+1)
print(*X)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int,input().split()))
for i in range(1,N+1):
  print(str(A.index(i)+1) + ' ', end = '')

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int,input().split()))
for i in range(1,N+1):
  print(str(int(A.index(i))+1) + ' ', end = '')

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int,input().split()))
E =[]
for i in range(1,N+1):
  E.append(int(int(A.index(i))+1))
for i in range(0,N): 
  print(str(int(E[i]))+' ',end = '')

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int,input().split()))
E =[]
for i in range(1,N+1):
  E.append(int(int(A.index(i))+1))
for i in range(0,N):
  a = int(E[i])
  print(str(a)+' ',end = '')

Submission status: Time Limit Exceeded

Solution code:
#ABC142_C
from operator import itemgetter
N=int(input())
A=list(map(int,input().split()))

ans=[]

while len(ans)!=len(A):
    min_index=A.index(min(A))
    ans.append(int(min_index)+1)
    A[min_index]=int(1e+5+1)
print(*ans)

Submission status: Time Limit Exceeded

Solution code:
#ABC142_C
N=int(input())
A=list(map(int,input().split()))

ans=[]

while len(ans)!=len(A):
    min_index=A.index(min(A))
    ans.append(int(min_index)+1)
    A[min_index]=int(1e+5+1)
print(*ans)

Submission status: Time Limit Exceeded

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

ans=[]

while len(ans)!=len(A):
    min_index=A.index(min(A))
    ans.append(int(min_index)+1)
    A[min_index]=int(1e+5+1)
print(*ans)

Submission status: Time Limit Exceeded

Solution code:
#ABC142_C
N=int(input())
A=input().split()
A=[int(i) for i in A]

ans=[]

while len(ans)!=len(A):
    min_index=A.index(min(A))
    ans.append(int(min_index)+1)
    A[min_index]=int(1e+5+1)
print(*ans)

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
a=list(map(int,input().split()))
b=[]
for i in range(1,n+1):
  b.append(a.index(i)+1)
print(*b)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

#print(A)
No=[]
for i in range(1,N+1):
  a=str(A.index(i)+1)
  No.append(a)

#print(No)
print(' '.join(No))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
t = list(map(int,input().split()))
s = ""
for i in range(n):
  for j in range(n):
    if t[j] == (i+1):
        s += "{} ".format(j+1)
print(s)

Submission status: Time Limit Exceeded

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

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

print(' '.join(list(map(str,sort_A))))

Submission status: Time Limit Exceeded

Solution code:
from operator import itemgetter

N = int(input())
A = list(map(int,input().split()))
sort_A = [0]*N

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

print(' '.join(list(map(str,sort_A))))

Submission status: Time Limit Exceeded

Solution code:
import numpy as np
N=int(input())
A=list(map(int,input().split()))
ans=np.zeros(N)
for i in A:
  ans[i-1]=A.index(i)+1
for j in ans:
  print(int(j),end=" ")

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
lists = input().split()
#print(lists)
ans = ''
for n in range(1,N+1):
    a = lists.index(str(n))+1
    #print(a)
    ans += str(a) + " "
print(ans)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
lists = input().split()
#print(lists)
ans = ''
for n in range(1,N+1):
    a = lists.index(str(n))+1
    #print(a)
    ans = ans + str(a) + " "
print(ans)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int,input().split()))
r = ""
for i in set(range(N)):
  r+= str(A.index(i+1)+1)
  r+= " "
print(r)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int,input().split()))
r = ""
for i in range(N):
  r+= str(A.index(i+1)+1)
  r+= " "
print(r)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())

members = list(map(int, input().split()))
junban = []

app = junban.append

for i in range(1, N+1):
  app(members.index(i)+1)
  
for i in junban:
  print(i,end=' ')

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
members = list(map(int, input().split()))
junban = []

for i in range(1, N+1):
  junban.append(members.index(i)+1)
  
for i in junban:
  print(i,end=' ')

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
h=list(map(int,input().split()))

ans_lst=[]
for i in range(1,n+1):
    ans_lst.append(str(h.index(i)+1))
print(' '.join(ans_lst))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int,input().split()))
r = []
for i in range(N):
  r.append(str(A.index(i+1)+1))
print(' '.join(r))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = list(map(int, input().split()))
anslist = []
for i in range(n):
    print(a.index(i+1) + 1, end=' ')

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = list(map(int, input().split()))
anslist = []
for i in range(n):
    anslist += [str(a.index(i+1)+1)]
print(" ".join(anslist))

Submission status: Time Limit Exceeded

Solution code:
import operator as op

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

L = [0] * N

for a in A:
    L[a-1] = A.index(a) + 1

print(*L)

Submission status: Time Limit Exceeded

Solution code:
import operator as op

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

L = []

for a in A:
    L.append([A.index(a) + 1, a])

L.sort(key=op.itemgetter(1))

ans = str()
for l in L:
    ans += str(l[0])
    if l[1] != N:
        ans += " "
print(ans)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
s = list(map(int,input().split()))
ans = [s.index(i)+1 for i in range(1,n+1)]
print(*ans)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int,input().split()))
R = ''
for i in range(1,N+1,1):
  R += str(A.index(i)+1) + " "
print(R)