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()))
b=[]
for i in range(1,n+1):
    for j in range(1,n+1):
        if a[j-1]==i:
            b.append(j)
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()))
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())
a = [ int(x) for x in input().split() ]
b = []

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

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

Submission status: Time Limit Exceeded

Solution code:
# C - Go to School
def main():
    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)))

if __name__ ==  "__main__":
    main()

Submission status: Time Limit Exceeded

Solution code:
# C - Go to School
def main():
    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)))
    
if __name__ ==  "__main__":
    main()

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int, input().split()))
B = [i+1 for i in range(N)]
flag = False
while flag!=True:
  flag = True
  for i in range(N-1):
    if A[i]>A[i+1]:
      A[i],A[i+1] = A[i+1],A[i]
      B[i],B[i+1] = B[i+1],B[i]
      flag = False

print(*B)

Submission status: Time Limit Exceeded

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

for i in range(n):
    j = s.index(i + 1) + 1
    p.append(str(j))

print(' '.join(p))

Submission status: Time Limit Exceeded

Solution code:
num=int(input())
line=list(map(int,input().split()))
line2=[0]*num
for student in line:
  line2[int(student)-1] += line.index(student) + 1
print(" ".join(map(str,line2)))

Submission status: Time Limit Exceeded

Solution code:
num = int(input())
line = input().split()
line2 = [0]* num

#studentの数字=出席順
for student in line:
  line2[int(student)-1] += line.index(student) + 1


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

Submission status: Time Limit Exceeded

Solution code:
num = int(input())
line = input().split()
line2 = [0]* num

#studentの数字=出席順
for student in line:
  line2[int(student)-1] += line.index(student) + 1

for student in line2:
  print(student, end = " ")

Submission status: Time Limit Exceeded

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

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

main()

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

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()))
count = 1
l = []
for i in range(0,N):
	for j in range(0,N):
		if(count == A[j]):
			l.append(j+1)
			count += 1
			break

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

attendance = []

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

print(*attendance)

Submission status: Time Limit Exceeded

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

attendance = []

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

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

Submission status: Time Limit Exceeded

Solution code:
def main():
    N=int(input())
    A = list(map(int, input().split()))
    ans=[0]*N
    for i in range(N):
        ans[i]=str(A.index(i+1)+1)
    print(' '.join(ans))
    
if __name__ == "__main__":
    main()

Submission status: Time Limit Exceeded

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

def main():
    N=int(input())
    A = list(map(int, input().split()))
    ans=[0]*N
    for i in range(N):
        ans[i]=str(A.index(i+1)+1)
    print(' '.join(ans))
    
if __name__ == "__main__":
    main()

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

Solution code:
def resolve():
    N = int(input())
    A = list(map(int, input().split()))
    ans = sorted(A)
    count =[]
    for i in ans:
        count.append(A.index(i)+1)
    print(*count)
resolve()

Submission status: Time Limit Exceeded

Solution code:
def resolve():
    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)
resolve()

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

from collections import deque
ans=deque()
j=1
while j<=n:
    ans.append(a.index(j))
    j+=1
for i in ans:
    print(i+1,end=" ")

Submission status: Time Limit Exceeded

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

ans=[]
j=1
while j<=n:
    for i in range(n):
        if a[i]==j:
            ans+=[i+1]
            j+=1
for i in ans:
    print(i,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(A.index(i)+1, end=" ")
print()

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 += [a.index(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(*b)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
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]=i+1
  
l=""  
for i in ans:
  l=l+str(i)+" "
  
  
print(l)

Submission status: Time Limit Exceeded

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

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

ans=""
for i in dic2:
  ans=ans+str(i[0])+" "
  
  
print(ans)

Submission status: Time Limit Exceeded

Solution code:
n= int(input())
st=list(map(int,input().split()))
#print(st)
for i in range(n):
    list =[[0]*2 for i in range(n)]
    
for j in range(len(list)):
    list[j][0]=j+1
    list[j][1]=st[j]
    
list.sort(key=lambda x: x[1])
#print(list)

for k in range(len(list)):
    print(list[k][0],end=' ')

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 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):
    print(a.index(i) + 1)

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)
for i in ans:
    print(i)

Submission status: Time Limit Exceeded

Solution code:
import os, sys, re, math

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

sa = ''
for s in sorted(A):
    sa += '%s ' % (A.index(s) + 1)
print(sa.strip())

Submission status: Time Limit Exceeded

Solution code:
import os, sys, re, math

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

print(' '.join(['%s' % (A.index(s) + 1) for s in sorted(A)]))

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

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

print(*l)

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

ans = ''
for i in range(1, n+1):
    rank = lst.index(i) + 1
    ans += ' ' + str(rank)


print(ans[1:])

Submission status: Time Limit Exceeded

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

ans = []
for i in range(1, n+1):
    rank = lst.index(i) + 1
    ans.append(str(rank))


print(' '.join(ans))

Submission status: Time Limit Exceeded

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

for i in range(1, N+1):
    min_p_index = p_num.index(i)+1
    print(min_p_index)

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

l = []
for i in range(n):
    x = a.index(i + 1) + 1
    l.append(x)

l = list(map(str, l))
print(' '.join(l))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = [int(x) for x in 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()))
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()))
B=[]
for i in range(1,N+1):
    B.append(A.index(i)+1)
print(*B)

Submission status: Time Limit Exceeded

Solution code:
#!/usr/bin/env python3
n = int(input())
a = list(map(int, input().split()))
b = 1
ans = []
for i in range(n):
    ans.append(a.index(b) + 1)
    b += 1
for i in ans:
    print(i)

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

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = list(input().split())
ans = []

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

print(*ans)

Submission status: Time Limit Exceeded

Solution code:
n,*a=map(int,open(0).read().split());print(*[-~a.index(-~i)for i in range(n)])

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
l = list(map(int,input().split()))
li = []
for i in range(1,n+1):
    a = l.index(i) #要素の番号取得
    li.append(str(a+1))
L = " ".join(li)
print(L)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
l = list(map(int,input().split()))
li = []
for i in range(1,n+1):
    a = l.index(i) #要素の番号取得
    li.append(a+1)
li =[str(a) for a in li]
L = " ".join(li)
print(L)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

print(*lis)

Submission status: Time Limit Exceeded

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

L=[str(a) for a in lis]
L=" ".join(L)
print(L)

Submission status: Time Limit Exceeded

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

lis = list()
for i in range(1, N+1):
    lis.append(A.index(i)+1)

L=[str(a) for a in lis]
L=" ".join(L)
print(L)

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

Submission status: Time Limit Exceeded

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

B = []

for i in range(1,N+1):
	idx = A.index(i) + 1
	#print(idx)
	B.append(idx)

print(*B)

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

A = [A.index(i+1) + 1 for i in range(N)]
print(*A)

Submission status: Time Limit Exceeded

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

for i in range(N):
    if i < N-1:
        print(A.index(i+1) + 1, end=" ")
    else:
        print(A.index(max(A)) + 1)

Submission status: Time Limit Exceeded

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

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines


def main():
    _ = int(readline())
    As = list(map(int, readline().split()))
    sorted_As = sorted(As)
    order = []
    for A in sorted_As:
        order.append(As.index(A))
    order = [str(o+1) for o in order]
    print(' '.join(order))


if __name__ == '__main__':
    main()

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

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

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
A=[int(x) for x in input().rstrip().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()))
ans=[]
for i in range(n):
    s=l.index(i+1)
    ans.append(s)
for j in ans:
    print(j+1, end=' ')

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
l=list(map(int,input().split()))
ans=[]
for i in range(n):
    for j in range(n):
        if i+1==l[j]:
            ans.append(j+1)
for i in ans:
    print(i, end=' ')

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
l = list(map(int,input().split()))
ans = ''

for i in range(n):
  ans += str(l.index(i+1) + 1) + ' '
print(ans)

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

B=[A.index(n)+1 for n in range(1,N+1)]

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

Submission status: Time Limit Exceeded

Solution code:
stdin = open(0).read().rstrip().split('\n')
N = int(stdin[0])
A = list(map(int,stdin[1].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=input()
A=list(map(int,input().split()))
B=[i for i in range(1,len(A)+1)]
reverse_ans=[]
while len(A)!=0:
  max_a,max_i=0,0
  for i in range(0,len(A)):
    if max_a < A[i]:
      max_a = A[i]
      max_i = i
  A.pop(max_i)
  reverse_ans.append(B.pop(max_i))
reverse_ans.reverse()
print(' '.join(map(str,reverse_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):
    tmp = A.index(i+1)
    ans[i] = tmp+1
    
print(' '.join([str(n) for n in ans]))

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

for i in range(N):
  m[i] = l.index(i+1)+1
  
print(*m)

Submission status: Time Limit Exceeded

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

for i in range(1,N+1):
  m.append(l.index(i)+1)
  
print(*m)

Submission status: Time Limit Exceeded

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

for i in range(1,N+1):
  m.append(l.index(i)+1)
  
print(*m)

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
def resolve():
    N = int(input())
    A = [int(i) for i in input().split()]
    for i in range(N):
        if i > 0:
            print(" ", end="")
        print(A.index(i + 1) + 1, end="")
    print()


resolve()

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int, input().split()))
ans = [0]*N
i=0
while i<N:
  j=0
  while j<N:
    if A[j]==i+1:
      ans[i]=j+1
    j+=1
  i+=1
print(*ans)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
l = list(map(int, input().split()))
a = [[i+1, l[i]] for i in range(n)]
a.sort(key=lambda x: x[1])
ans = ""
for i in range(n):
  ans = ans + str(a[i][0]) + " "

print(ans)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

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

ans = [str(n) for n in ans]
ans = ' '.join(ans)

print(ans)

Submission status: Time Limit Exceeded

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

#i=1
for i in range(1,N+1):
    AList.append((List.index(i))+1)
    #i+=1
    
print(*AList)

Submission status: Time Limit Exceeded

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

i=1
while i<=N:
    AList.append((List.index(i))+1)
    i+=1
    
print(*AList)

Submission status: Time Limit Exceeded

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

i=1
while i<=N:
    AList.append((List.index(i))+1)
    
    i+=1
    
print(*AList)

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:
# ABC 142 C 
N = int(input())
A = [int(j) for j in 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=list(map(int,input().split()))
ans=[0]*n
for i in a:
    ans[i-1]=a.index(i)+1
print(*ans)

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
a=list(map(int,input().split()))
ans=[0]*n
for i in a:
    ans[i-1]=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()))
B = []
for i in range(N):
    B.append(A.index(i+1)+1)
C = map(str, B)
D = " ".join(C)
print(D)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = list(map(int, input().split()))
ord = [i+1 for i in range(len(a))]
ans = []
for i in ord:
    ans.append(a.index(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(len(a)):
    for j in a:
        if i+1 == j:
            ans.append(a.index(j)+1)
print(*ans)

Submission status: Time Limit Exceeded

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