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 = [int(i) for i in input().split()]
B=[0]*N
for i in range(N):
  B[A[i]-1]=i+1

ans=''
for i in range(N-1):
  ans = ans + str(B[i])+' '
ans = ans + str(B[N-1])
print(ans)

Submission status: Time Limit Exceeded

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

tmpList=QsList[:]
tmpList.sort()
tmp=0
AnsList=QsList[:]
for i in QsList:
  tmp=tmp+1  

  a=int(tmpList.index(i))
  AnsList[a]=tmp
print(*AnsList)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int,input().split(" ")))
 
def bb(N,A):
	aa = [str(A.index(x)+1) for x in range(1,N+1)]
	print(" ".join(aa))


if __name__ == '__main__':
    bb(N,A)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int,input().split(" ")))
 
def bb(N,A):
	aa = [str(A.index(x)+1) for x in range(1,N+1)]
	print(" ".join(aa))

if __name__ == '__main__':
    bb(N,A)

Submission status: Time Limit Exceeded

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

for i in range(1,n+1):
  ans.append(a.index(i)+1)
  
output=''
for x in ans:
	output += str(x) +' '
    
print(output)

Submission status: Time Limit Exceeded

Solution code:
import sys
import itertools
input = sys.stdin.readline

#単入力
n=int(input())

#リスト入力
a = [int(i) for i in input().split()]
for i,j in itertools.product(range(1,n+1), range(n)):
    if a[j]==i:
        print(j+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):    
    c = a.index(i)
    c += 1
    print(c,end=' ')

Submission status: Time Limit Exceeded

Solution code:
import copy

N=int(input())

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

ans=copy.copy(li)

for n in range(N):
  ans.pop(li[n]-1)
  ans.insert(li[n]-1,n+1)

print(*ans)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = tuple(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())
alist = [int(x) for x in input().split()]
attends = [alist.index(y) + 1 for y in sorted(alist)]
print(*attends)

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
a_list=list(map(int,input().split()))
b_list=[]
counter=1
while counter <= n :
    for i in range(n):
        if a_list[i]==counter:
            b_list.append(i+1)
    counter+=1
print(*b_list)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
import sys
input = sys.stdin.readline

#単入力
n=int(input())

#リスト入力
a = [int(i) for i in input().split()]

for i in range(1,n+1):
    for j in range(n):
        if a[j]==i:
            print(j+1,end=' ')
            break

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
data = input().split(" ")
s  = ""
memo = {}
for i in range(n):
    idx = 0
    for j in data:
        if (i+1) in memo:
            #print("{} is memorized".format(i+1))
            continue
        if (i+1)==int(j):
            ss = str(idx+1)
            s += ss + " "
            memo[i+1] = 1
        idx += 1

print( s[0:-1] )

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
import sys
input = sys.stdin.readline

#単入力
n=int(input())

#リスト入力
a = [int(i) for i in input().split()]

for i in range(1,n+1):
    for j in range(n):
        if a[j]==i:
            print(j+1,end=' ')
            continue

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = input().rstrip().split(" ")
i = 0
j = 0
ans = []

for i in range(int(n)):
    for j in range(int(n)):
        if int(i) + 1 == int(a[j]):
            print(int(j) + 1 , end = " ")

Submission status: Time Limit Exceeded

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

for i in range(n):
  for j in range(n):
    if listA[j]==i+1:
      print("%d " % (j+1), end="")
      break

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = list(map(int,input().split()))
d={}
for i in range(n):
    d[i+1]=a[i]
kt = list(d.keys()) 
vt = list(d.values())
a.sort()
for i in range(n):
    print(kt[vt.index(a[i])], end =" ")

Submission status: Time Limit Exceeded

Solution code:
if __name__ == '__main__':
    N = int(input())
    order_list = list(map(int, input().split()))
    present_list = list()

    for i in range(1, (N+1)):
        present_list.append(order_list.index(i) + 1)

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

Submission status: Time Limit Exceeded

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

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(int(1+A.index(i)))


print(*ans)

Submission status: Time Limit Exceeded

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

tmpList=QsList[:]
tmpList.sort()

AnsList=QsList[:]
for i in QsList:
  tmp=int(QsList.index(i))+1
  a=int(tmpList.index(i))
  AnsList[a]=tmp
  
print(*AnsList)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
a=list(map(int, input().split()))
e=list(range(1,n+1))
d=dict(zip(e,a))
f=sorted(d.items(), key=lambda x: x[1])
g=str(f[0][0])
for i in range(1,n):
    g = g + " " + str(f[i][0])
print(g)

Submission status: Time Limit Exceeded

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

i = 0

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

print(*list)

Submission status: Time Limit Exceeded

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

for i in range(N):
    result = A.index(i+1) + 1
    R.append(result)

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

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = list(map(int, input().split()))
x = []
x = [0 for i in range(n)]
for j in range(n):
    x.pop(a[j] - 1)
    x.insert(a[j] - 1, j + 1)
print(" ".join(map(str, x)))

Submission status: Time Limit Exceeded

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

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 += [str(a.index(i)+1)]
print(' '.join(order))

Submission status: Time Limit Exceeded

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

ans = []

for i in range(1,n+1):
  ans.append(a.index(i)+1)
  
output=''
for x in ans:
	output += str(x) +' '
    
print(output)

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

tmpList=QsList[:]
tmpList.sort()

cnt=0
tmp=0
AnsList=QsList[:]
for i in QsList:
  tmp=int(QsList.index(i))+1
  a=int(tmpList.index(i))
  a=int(a)
  AnsList[a]=tmp
  
print(*AnsList)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int,input().split(" ")))
 
aa = [str(A.index(x)+1) for x in range(1,N+1)]
print(" ".join(aa))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = [int(i) for i in input().split()]
for i in range(n):
  print(a.index(i+1)+1)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
students = input().split()
turns = [str(students.index(str(x)) + 1) for x in range(1, N + 1) ]
print(' '.join(turns))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
data = input().split(" ")
s  = ""
for i in range(n):
    idx = 0
    for j in data:
        if (i+1)==int(j):
            s += str(idx+1) + " "
        idx += 1

print( s[0:-1] )

Submission status: Time Limit Exceeded

Solution code:
from sys import stdin
n=int(stdin.readline().rstrip())
l=[int(x) for x in stdin.readline().rstrip().split()]
print(*[l.index(i)+1 for i in range(1,n+1)],sep=" ")

Submission status: Time Limit Exceeded

Solution code:
import sys
input = sys.stdin.readline

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

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = tuple(map(int,input().split()))
S = ''

for i in range(N):
    S += str((A.index(i+1))+1) + ' '

print(S)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
import sys
input = sys.stdin.readline

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
a = list(map(int, input().split()))
x=[]
for i in range(1,n+1):
    for t in range(n):
        if a[t]==i:
            num=t+1
            x.append(num)
for q in x:
    print(q,end=" ")

Submission status: Time Limit Exceeded

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

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


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

Submission status: Time Limit Exceeded

Solution code:
import numpy as np
n=int(input())
a=np.array(input().split(" "),dtype="int64")
a_=list(a[:])
a=np.sort(a)
for i in a:
	print(a_.index(i)+1,end=" ")

Submission status: Time Limit Exceeded

Solution code:
import numpy as np

N = int(input())
L = list(map(int, input().split()))
L = np.array(L)
ans=""

for k in range(N):
    index = np.where(L==k+1)
    tmp=str(index[0][0]+1)+" "
    ans+=tmp

print(ans)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = tuple(map(int,input().split()))
S = ''

for i in range(N):
    n = A.index(i+1)
    S = S + str(n+1) + ' '

print(S)

Submission status: Time Limit Exceeded

Solution code:
if __name__ == '__main__':
    N = int(input())
    order_list = list(map(int, input().split()))

    for i in range(1, (N+1)):
        print(order_list.index(i) + 1, 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 = [i-1 for i in list(map(int,input().split()))]
print(" ".join(map(str,[1 + a.index(i) for i in range(n)])))

Submission status: Time Limit Exceeded

Solution code:
import numpy as np
n=int(input())
a=(list(map(int,input().split(" "))))
a_=a[:]
a=np.sort(a)
for i in a:
	print(a_.index(i)+1,end=" ")

Submission status: Time Limit Exceeded

Solution code:
if __name__ == '__main__':
    N = int(input())
    order_list = list(map(int, input().split()))
    present_num_list = list(range(1, (N+1)))

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

Submission status: Time Limit Exceeded

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

for i in a_list:
  f_list[i-1]= a_list.index(i)+1

#print(n)
for i in f_list:
    print(i,end=' ')
print('')

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = list(map(int, input().split()))
x = []
for i in range(n):
    x.append(0)
for j in range(n):
    x.pop(a[j] - 1)
    x.insert(a[j] - 1, j + 1)
print(" ".join(map(str, x)))

Submission status: Time Limit Exceeded

Solution code:

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

S = []
for i in range(N):
    S.append(A.index(max(A))+1)
    A[A.index(max(A))] -= 100000

for i in reversed(S):
    print(str(i) + " ")

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
array = list(map(int,input().split()))
ans = []
k = 0
while n > k:
  i = 0
  while n > i:
    if array[i] == k + 1:
      ans.append(i+1)
      k += 1
      break
    i += 1
print(" ".join(map(str, ans)))

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = tuple(input().split())
B = []
 
for x in range(1,N+1):
    B.append(A.index(str(x)) + 1)
print(*B)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = input().rstrip().split(" ")
i = 0
j = 0
ans = []

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
import sys
input = sys.stdin.readline

N = int(input())
caps = list(map(int, input().split()))
out = [caps.index(i+1)+1 for i in range(N)]
print(" ".join(map(str, out)))

Submission status: Time Limit Exceeded

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

tmpList=QsList[:]
tmpList.sort()

cnt=0
tmp=0
AnsList=QsList[:]
for i in QsList:
  tmp=int(QsList.index(i))+1
  a=int(tmpList.index(i))
  a=int(a)
  AnsList[a]=tmp
  
for i in AnsList:
  print(i,end=" ")

Submission status: Time Limit Exceeded

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

B = [int(n+1) for n in range(N)]

for i in range(N-1) :
  for j in range(N-(i+1)) :
    if A[i] > A[i+j+1] :
      a = A[i]
      b = A[i+j+1]
      A[i] = b
      A[i+j+1] = a
      c = B[i]
      d = B[i+j+1]
      B[i] = d
      B[i+j+1] = c

#print('N', N)
#print('A', A)
#print('B', B)

B = [str(n) for n in B]

result = ' '.join(B)

print(result)

Submission status: Time Limit Exceeded

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

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(A.index(i)+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.append(A.index(i)+1)
    print(A.index(i)+1,end=' ')

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
alist = [int(x) for x in input().split()]
attends = [alist.index(y) + 1 for y in range(1, n + 1)]
print(*attends)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = list(map(int,input().split()))
b = list()
for i in range(n+1):
    if i==0:
        continue
    else:
        c = a.index(i)
        c = c+1
        b.append(c)
for j in b:       
    print(j,end=' ')

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

Solution code:
import sys
input = sys.stdin.readline

#単入力
n=int(input())

#リスト入力
a = [int(i) for i in input().split()]


l=[]
for i in range(1,n+1):
    for j in range(n):
        if a[j]==i:
            print(j+1,end=' ')

Submission status: Time Limit Exceeded

Solution code:
n = int(input())

data  = input().split()

for m in range(n):
    data[m] = int(data[m])

res = []

for i in range(1,n+1):
    for m in range(len(data)):
        if i == data[m]:
            res.append(m+1)
res = map(str, res)

print(' '.join(res))

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
N = int(input())

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

for i in range(1, N + 1):
    for j in range(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()))

num = []
for i in range(N) : 
    num.append(A.index(max(A)) + 1)
    A[A.index(max(A))] = 0
    
for i in range(N) :
    print(num[N-1-i], end = ' ')

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
array = list(map(int,input().split()))
ans = []
k = 0
while n > k:
  i = 0
  while n > i:
    if array[i] == k + 1:
      ans.append(i+1)
      k += 1
    i += 1
print(" ".join(map(str, ans)))

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
alist=list(map(int, input().split()))
narabi={}
for i in range(1,n+1):
	narabi[alist.index(i)+1]=i
narabi_sorted=sorted(narabi.items(), key=lambda x: x[1])
for i in range(n):
	print(narabi_sorted[i][0],end=" ")

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a=list(map(int,input().split()))
j = 1
ans = list()
while j <= n:
    ans.append(a.index(j)+1)
    j = j+1
print(' '.join(map(str, ans)))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
Alist = [int(i) for i in input().split()] 
for i in range(1,n+1):
    print(Alist.index(i)+1)

Submission status: Time Limit Exceeded

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

for i in range(N):
    order_list.append(A.index(i+1))

for x in order_list:
    print(str(x+1) + ' ', end='')

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
def comp(h):
  for i in range(1,len(h)+1):
    print(h.index(i)+1,end=" ")

N = int(input())
h = list(map(int,input().split()))
comp(h)

Submission status: Time Limit Exceeded

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

for i in range(N+1):
  for item in array:
    if(item == i): 
      print(array.index(item)+1, end=" ")
      break;

Submission status: Time Limit Exceeded

Solution code:

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

S = []
for i in range(N):
    S.append(A.index(max(A))+1)
    A[A.index(max(A))] -= 100000

S.reverse()
for i in range(N):
    print(str(S[i]) + " ")

Submission status: Time Limit Exceeded

Solution code:
number =int(input())
orders =input().rstrip().split(" ")
for j in range(number):
  for i in range(len(orders)):
    if int(orders[i])==j+1:
    	print(i+1 ,end=" ")

Submission status: Time Limit Exceeded

Solution code:
import numpy as np
N = int(input())
A = list(map(int, input().split())) 
R = []

for i in range(N):
    result = A.index(i+1) + 1
    R.append(result)

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

Submission status: Time Limit Exceeded

Solution code:
import copy

N=int(input())

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

ans=copy.copy(li)

for n in range(N):
  x=li[n]
  ans.pop(x-1)
  ans.insert(x-1,n+1)

print(*ans)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(int(x) for x in input().split())
ans = [None] * N
for i in range(N):
    b = A.index(i + 1)
    ans[i] = b + 1
for i in range(N):
    print(ans[i])

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())
l=list(map(int,input().split()))
for i in range(1,n+1):
  print(str(l.index(i)+1)+" ",end="")

Submission status: Time Limit Exceeded

Solution code:
import copy

N=int(input())

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

ans=copy.deepcopy(li)

for n in range(N):
  x=li[n]
  ans.pop(x-1)
  ans.insert(x-1,n+1)

print(*ans)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
students = [int(x) for x in input().split()]
turns = [str(students.index(x) + 1) for x in range(1, N + 1) ]
print(' '.join(turns))

Submission status: Time Limit Exceeded

Solution code:
import sys
input = sys.stdin.readline

#単入力
n=int(input())

#リスト入力
a = [int(i) for i in input().split()]


l=[]
for i in range(1,n+1):
    for j in range(n):
        if a[j]==i:
            l.append(j+1)
for i in range(len(l)):
    print(l[i],end=' ')

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = tuple(map(int,input().split()))
S = ''

for i in range(N):
    n = A.index(i+1)
    S += str(n+1) + ' '

print(S)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
alist = input().split()
Alist = []
for i in alist:
    Alist.append(int(i))
for i in range(1,n+1):
    print(Alist.index(i)+1)

Submission status: Time Limit Exceeded

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

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

print(' '.join(ans))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
H = input().split()
H_i = [int(h) for h in H]

answer = []
for i in range(1,N+1,1):
    answer.append(H_i.index(i)+1)
print(' '.join(map(str,answer)))

Submission status: Time Limit Exceeded

Solution code:
import sys
def input():
    return sys.stdin.readline()[:-1]


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()))

T = []
for i in range(N):
    count = 0
    while A[count] != i+1:
        count += 1
    else:
        T.append(count+1)
       
print(*T)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(int(x) for x in input().split())
ans = [None] * N
for i in range(N):
    b = A.index(i + 1)
    ans[i] = b
for i in range(N):
    c = ans[i] + 1
    print(c)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
alist = input().split()
Alist = []
for i in alist:
    Alist.append(int(i))
Result = []
for i in range(1,n+1):
    Result.append(Alist.index(i)+1)
    print(Result[i-1])

Submission status: Time Limit Exceeded

Solution code:
number =int(input())
orders =input().rstrip().split(" ")
studentnumbers =[]

for j in range(number):
  for i in range(len(orders)):
    if int(orders[i])==j+1:
      studentnumbers.append(i+1)
#print(studentnumbers)
for k in range(number):
  print(studentnumbers[k] ,end=" ")

Submission status: Time Limit Exceeded

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

ans = []

for i in range(n):
  find = a.index(i + 1)
  ans.append(find + 1)

print(*ans, sep=' ', end=" ")

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

shusseki_jun=[' ' for _ in range(N)]
for i in range(N):
    shusseki_jun[i] = str(A.index(str(i+1))+1)

print(' '.join(shusseki_jun))

Submission status: Time Limit Exceeded

Solution code:
# -*- coding: utf-8 -*-

if __name__ == "__main__":
    N = int(input())
    a = list(map(int,input().split()))
    l = []
    for i in range(1,N+1):
        l.append(a.index(i)+1)
    print(" ".join(map(str,l)))

Submission status: Time Limit Exceeded

Solution code:
import sys
input = sys.stdin.readline

def main():
    N = int(input())
    caps = list(map(int, input().split()))
    out = [caps.index(i+1)+1 for i in range(N)]
    print(" ".join(map(str, out)))

main()

Submission status: Time Limit Exceeded

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

S = []
for i in range(N):
    B = A.index(max(A))
    A[A.index(max(A))] -= 100000
    S.append(B+1)


for i in reversed(range(0,N)):
    print(str(S[i]) + " ")

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = tuple(input().split())
B = []

for x in range(1,N+1):
    m = A.index(str(x)) + 1
    B.append(str(m))
print(" ".join(B))

Submission status: Time Limit Exceeded

Solution code:
import sys


N = int(sys.stdin.readline())
A = list(map(int, sys.stdin.readline().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()))
ans = []
dic = {}

for i, j in enumerate(A):
    dic[i+1] = j
    dic_s = sorted(dic.items(), key=lambda x: x[1])
for i in dic_s:
    ans.append(i[0])
print(' '.join(map(str, ans)))

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:
n = int(input())
alist = list(map(int, input().split()))
attends = [alist.index(x) + 1 for x in range(1, n + 1)]
print(*attends)

Submission status: Time Limit Exceeded

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

while i<=n:
    print(a.index(i)+1, end=" ")
    i+=1

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

ans_list = []
for i in range(N):
    print((A_list.index(i + 1) + 1), end = ' ')

Submission status: Time Limit Exceeded

Solution code:
n = int(raw_input())
data = raw_input().split()
s = ''
for i in range (1, n + 1):
    j = 0
    while (int(data[j]) != i):
        j+=1
    s += str(j + 1) + ' '
print (s)

Submission status: Time Limit Exceeded

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

for i in range(n):
    if i != n-1:
        print(a_l.index(i+1)+1, end=" ")
    else:
        print(a_l.index(i+1)+1)

Submission status: Time Limit Exceeded

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

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()))


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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:

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

S = []
for i in range(N):
    B = A.index(max(A))
    A[A.index(max(A))] -= 100000
    S.append(B+1)


for i in reversed(range(0,N)):
    print(str(S[i]) + " ")

Submission status: Time Limit Exceeded

Solution code:
n = int(input())

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

i = 0
list = []

for a_s in a:
    list.insert(0, (a.index(n - i) + 1))
    i += 1

print(*list)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

ans_list = []
for i in range(N):
    ans_list.append(A_list.index(i + 1) + 1)

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

Submission status: Time Limit Exceeded

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


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

Submission status: Time Limit Exceeded

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

ansAr = []
for i in range(N):
    ansAr.append(ar.index(i+1)+1)

print(" ".join([str(n) for n in ansAr]))

Submission status: Time Limit Exceeded

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

ans=""

for k in range(N):
    tmp=[i for i, x in enumerate(L) if x == k+1]
    tmp=str(tmp[0]+1)+" "
    ans+=tmp
print(ans)

Submission status: Time Limit Exceeded

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