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 = list(map(int,input().split()))

reply = []
for i in range(len(a_list)):
    reply.append(str(a_list.index(i+1)+1))

print(' '.join(reply))

Submission status: Time Limit Exceeded

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

ans = list(range(0,N))
for i in nums:
    ans[i-1] = nums.index(i)+1
print(*ans)

Submission status: Time Limit Exceeded

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

ans = list(range(0,N))
for i in nums:
    ans[i-1] = nums.index(i)+1

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

Submission status: Time Limit Exceeded

Solution code:
N = int( input() )
s_list = [ int(i) for i in input().split() ]
for i in range( 1, N+1):
    print(s_list.index(i) + 1,end=" ")

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
N = int( input() )
s_list = [ int(i) for i in input().split() ]
for i in range( 1, N+1):
    print(s_list.index(i)+1,end=" ")

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

order = ""
for i in range(len(A_lis)):
    order+=str(A_lis.index(i+1)+1)
    order+=" "
print(order)

Submission status: Time Limit Exceeded

Solution code:
a = int(input())
l=list(map(int ,input().split()))
for i in range(a):
    print((l.index(i+1))+1, 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(a.index(i)+1)
print(*ans)

Submission status: Time Limit Exceeded

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

for i in range(N):
    for j in range(N):
        if A[j]==i+1:
            print(j+1)

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)

import numpy as np
C = str(np.array(B))
print(C[1:-1])

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
l = [int(x) for x in input().split()]
l_dict = {k: v for v, k in enumerate(l)}
l.sort()

s = ""
for x in l:
    s = s + str(l_dict[x] + 1) + " "

print(s[:-1])

Submission status: Time Limit Exceeded

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

l_sorted = sorted(l)

s = ""
for x in l_sorted:
    s = s + str(l.index(x) + 1) + " "

print(s[:-1])

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[i]=(A.index(i+1))+1
print(*ans)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
As = input().split()

order = []
for i in range(1, n+1):
    order.append(As.index(str(i)) + 1)
ans = ''
for i in range(len(order)):
    ans += str(order[i])
    if i != len(order) - 1:
        ans += ' '
print(ans)

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
come=input()
come=come.split()
come_list=[]
for i in come:
    come_list.append(int(i)) 
rank=[]
for i in range(N):
    rank.append(0)
count=1

for i in come_list:
    rank[i-1]=count
    count+=1


out_put=str(rank[0])

for i in rank[1:]:
    out_put+=" "+str(i)

print(out_put)

Submission status: Time Limit Exceeded

Solution code:
n = input()
a = input().split()

result = []

for i in range(len(a)):
    result.append(a.index(str(i + 1)) + 1)

print(*result)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

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

ans = ''
for k, v in sorted:
    ans += str(k) + ' '
print(ans)

Submission status: Time Limit Exceeded

Solution code:
N=raw_input()
n=int(N)

AN=raw_input().split()
an=[int(i) for i in AN]

on = [str(an.index(i+1) + 1) for i in range(len(an))]
print " ".join(on)

Submission status: Time Limit Exceeded

Solution code:
# https://atcoder.jp/contests/abc142/tasks/abc142_c
# -*- coding: utf-8 -*-

stu_cnt = int(input())
stu_bangou = list(map(int, input().strip().split()))

print_str = [0] * stu_cnt
for i in range(1,stu_cnt+1):
    print_str[i-1] = stu_bangou.index(i) + 1
#    print_str += (str(stu_bangou.index(i)+1) + " ")
#    stu_junban.append(stu_bangou.index(i)+1)

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

Submission status: Time Limit Exceeded

Solution code:
# https://atcoder.jp/contests/abc142/tasks/abc142_c
# -*- coding: utf-8 -*-

stu_cnt = int(input())
stu_bangou = list(map(int, input().strip().split()))

print_str = ""
for i in range(1,stu_cnt+1):
    print_str += (str(stu_bangou.index(i)+1) + " ")
#    stu_junban.append(stu_bangou.index(i)+1)

print(print_str)

Submission status: Time Limit Exceeded

Solution code:
# https://atcoder.jp/contests/abc142/tasks/abc142_c
# -*- coding: utf-8 -*-

stu_cnt = int(input())
stu_bangou = list(map(int, input().strip().split()))

stu_junban = list()
for i in range(1,stu_cnt+1):
    stu_junban.append(stu_bangou.index(i)+1)

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
students = list(map(lambda x: int(x)-1,input().split()))

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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


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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

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

print(' '.join(str(a) for a in ans))

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
a=[int(c) for c in input().split()]
for num in range(n):
    print(a.index(num+1)+1,end=" ")

Submission status: Time Limit Exceeded

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

out = []
for i in range(N):
    for j in range(N):
        if A_list[j] == i+1:
            out.append(j+1)
            break
        
print(*out)

Submission status: Time Limit Exceeded

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

dic = {}
for i in range(n):
    dic[i + 1] = a[i]

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

ans = ""
for i in dic_sorted:
    ans = ans + ' ' + str(i[0])

print(ans)

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
St=[int(x) for x in input().split()]
num=1
out=[]
while num<=N:
  for i in range(N):
    if St[i] ==num:
      out.append(str(i+1))
      num+=1
print(' '.join(out))

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
St=[int(x) for x in input().split()]
num=1
out=[]
while num<=N:
  for i in range(N):
    if St[i] ==num:
      out.append(i)
      num+=1
for i in range(N):
  print(out[i]+1,end=" ")

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
St=[int(x) for x in input().split()]
num=1
out=[]
while num<=N:
  for i in range(N):
    if St[i] ==num:
      out.append(i)
      num+=1

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

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
St=[int(x) for x in input().split()]
num=1
out=''
while num<=N:
  for i in range(N):
    if St[i] ==num:
      out=out+str(i+1)+' '
      num+=1
print(out)

Submission status: Time Limit Exceeded

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

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


if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

Solution code:
# ABC C - Go to school

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

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

for j in range(len(_list)):
    print(_list[j], end = ' ')

print()

Submission status: Time Limit Exceeded

Solution code:
# ABC C - Go to school

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

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

print()

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = list(map(int, input().split()))
for i in range(n):
    for j in range(n):
        if a[j] == (i+1):
            if (i+1) != n:
                print(j+1, end = " ")
            else:
                print(j+1)
            break

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = list(map(int, input().split()))
for i in range(n):
    for j in range(n):
        if a[j] == (i+1):
            if (i+1) != n:
                print(j+1, end = " ")
            else:
                print(j+1)

Submission status: Time Limit Exceeded

Solution code:
number_of_students = int(input())
number_in_class = list(map(int, input().split()))
# 多重内包表記 あんましないほうがいいかも
[print(a, end=" ") for a in [(number_in_class.index(i) + 1)for i in range(1, number_of_students + 1)]]

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
number_of_students = int(input())
number_in_class = list(map(int, input().split()))
arrival = [(number_in_class.index(i) + 1)for i in range(1, number_of_students + 1)]
for i in arrival:
    print(i, end=" ")

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
a=input().split()
c=[n for n in range(N)]
print(" ".join([str(a.index(str(_+1))+1) for _ in c]))

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
a=input().split()
b=sorted([int(_) for _ in a])
print(" ".join([str(a.index(str(_))+1) for _ in b]))

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
A=list(map(int,input().split()))
B=sorted(A)
print(' '.join([str(A.index(b)+1) for b in B]))

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
A=list(map(int,input().split()))
B=sorted(A)
for b in B:
    if b == len(B):
        print(A.index(b)+1)
    else:
        print(A.index(b)+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(a.index(i+1)+1, end=" ")
print("\n")

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=input().split()
sp=' '
ans=''
for i in range(n):
	if i!=0:
		ans+=sp
	ans+=str(a.index(str(i+1))+1)
print(ans)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
o_lst=[]
lst = list(map(int, input().split()))
for i in lst:
    idx = lst.index(min(lst))
    print(idx+1,end=" ")
    #o_lst.append(idx+1)
    lst[idx]=N+1

Submission status: Time Limit Exceeded

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

B = []

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

print(*B)

Submission status: Time Limit Exceeded

Solution code:
# coding: utf-8
# Your code here!

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 = [int(x) for x in input().split()]
ans_list = []
for i in range(1, len(A) + 1):
  #print(i)
  for j in range(1, len(A) + 1):
    #print(j)
    if i == A[j - 1]:
      ans_list.append(j)
      break
map_ans_list = map(str, ans_list)
print(' '.join(map_ans_list))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
nu = [int(x) for x in input().split()]
r2 = [None] * N

for i in range(len(nu)):
  r2[nu[i] - 1] = i
#for i in nu:
#  r2[i] = nu.index(i)
ans = ""
for i in range(len(r2)):
  ans = ans + str(r2[i] + 1) + " "
print(ans)
#print(" ".join([str(x + 1) for x in r2]))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
nu = [int(x) for x in input().split()]
r2 = {}

for i in nu:
  r2[i] = nu.index(i)
#print(r2)

j2 = []
for i in range(len(r2)):
  j2.append(r2[i+1]+1)
#print(j2)

print(" ".join([str(x) for x in j2]))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
nu = [int(x) for x in input().split()]
r2 = {}

for i in nu:
  r2[i] = nu.index(i)
#print(r2)

j2 = []
for i in range(len(r2)):
  j2.append(r2[i+1]+1)
#print(j2)

answ = ""
for i in j2:
  #answ = answ + str(i) + " "
  print(i, end=" ")
print(answ)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
nu = [int(x) for x in input().split()]
r2 = {}

for i in nu:
  r2[i] = nu.index(i)

j2 = []
for i in range(len(r2)):
  j2.append(r2[i+1]+1)
#print(j2)

answ = ""
for i in j2:
  answ += str(i) + " "
print(answ)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
def t(n, a):
    return ' '.join([str(a.index(i) + 1) for i in range(1, n + 1)])


if __name__ == "__main__":
    n = int(input())
    a = list(map(int, input().split()))
    print(t(n, a))

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

    
print(*B)

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = []#生徒たちが出席した順番
students = []#生徒たちの番号
rank_sort = []#出席した順の生徒たちの番号

i = 0
for x in input().split():
    i += 1
    A.append(int(x))
    students.append(int(i))

rank = 1
n = N
for i in range(N):
    for j in range(n):
        if A[j] == rank:
            rank_sort.append(students[j])
            del A[j]
            del students[j]
            break
    rank += 1
    n -= 1
print(' '.join(map(str,rank_sort)))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())

A = list(map(int, input().split()))
B = []

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

for i in range(N):
	print(B[i])

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
nu = [int(x) for x in input().split()]
r2 = {}

for i in nu:
  r2[i] = nu.index(i)
#print(r2)

kyt = ""
for ky in r2.values():
  ky = str(ky +1)
  kyt = kyt + ky + " "
print(kyt)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
nu = [int(x) for x in input().split()]
r2 = {}

for i in nu:
  r2[i] = nu.index(i)
#print(r2)

j2 = []
for i in range(len(r2)):
  j2.append(r2[i+1]+1)
#print(j2)

answ = ""
for i in j2:
  answ = answ + str(i) + " "
print(answ)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
nu = [int(x) for x in input().split()]
ans = ["a" for x in range(len(nu))]
                          
for i, v in enumerate(nu):
  #print("i=", i)
  #print("v=", v)
  ans[v-1] = i+1
#print(ans)

answ = ""
for i in ans:
  answ = answ + str(i) + " "
print(answ)

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())
number = [int(i) for i in input().split()]
lis = []
for i in range(1,n+1):
  lis.append(number.index(i))
tasu = lambda x : x + 1
ans = list(map(tasu,lis))
print(" ".join(map(str,ans)))

Submission status: Time Limit Exceeded

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

for y in b:
    for x in a:
        if y == x:
            print(a.index(x) + 1, end=' ')

Submission status: Time Limit Exceeded

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

for y in b:
    for x in a:
        if y == x:
            print(a.index(x)+1, end=' ')

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = list(map(int, input().split()))
print(*[A.index(n+1)+1 for n in range(N)]) # TLE?

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
attends = [int(each) for each in input().split(' ')]
ordered = attends.copy()
ordered.sort()
for each in ordered:
    print(attends.index(each) + 1, end=' ')

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
attends = [int(each) for each in input().split(' ')]
ordered = sorted(attends)
for each in ordered:
    print(attends.index(each) + 1, end=' ')

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
attends = [int(each) for each in input().split(' ')]
ordered = sorted(attends)
ans = ''
for each in ordered:
    ans += str(attends.index(each) + 1) + ' '
print(ans)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

def find(list, n):
  for i in range(len(list)):
    if list[i] == n:
      return i+1
    
for i in range(n):
  a = find(ls, i+1) #f(ls,1) -> a = 3 
  print(a, end=" ")

Submission status: Time Limit Exceeded

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

S = ""
for i in range(N):
  S += str(A.index(i+1)+1)
  if i != N:
    S += " "
  
print(S)

Submission status: Time Limit Exceeded

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

print_str = ''

for i in range(N):
    if i != N-1:
        print_str += str(A.index(i+1)+1) + ' '
    else:
        print_str += str(A.index(i+1)+1)
    
print(print_str)

Submission status: Time Limit Exceeded

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

ans = []
for k in range(0,len(A)):
    ans.append(A.index(k+1))
    
ans = list(map(lambda x:x+1, ans))
ans = list(map(str, ans))
L = " ".join(ans)

print(L)

Submission status: Time Limit Exceeded

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

for i in range(N):
  box.insert(i,A.index(i+1)+1)

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

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
A = list(map(int, input().split()))
import numpy as np
A = np.array(A)
for i in range(n):
    b = np.where(A==i+1)
    print(b[0][0]+1)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

p.sort(key=lambda x: x[1])
r = ''
q = [x[0] for x in p]
for i in range(n) :
    r = r + ' ' + str(q[i])

print (r)

Submission status: Time Limit Exceeded

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

for i in range(n):
  for j in range(n):
    if a[j] == i + 1:
      b.append(str(j+1))
      break

print(' '.join(b))

Submission status: Time Limit Exceeded

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

p.sort(key=lambda x: x[1])
r = ''
for i in range(n) :
    r = r + ' ' + str(p[i][0])

print (r)

Submission status: Time Limit Exceeded

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

r = ''
for i in range(n) :
    for j in range(n) :
        if p[j][1] == (i + 1) :
            r = r + ' ' + str(p[j][0])

print (r)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = [int(i) for i in input().split()]
a = 1
for s in range(N):
  for t in range(N):
    if A[t] == a:
      print(t+1,end=" ")
      a += 1

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

for i in range(N):
    print("{} ".format(O[i]),end="")
print("\n")

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()))
for i in range(n):
  if i==0:
    print(str(a.index(i+1)+1), end="")
  else:
    print(' '+str(a.index(i+1)+1), end="")

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
def main():
  d = {}
  input()
  l = list(map(int, input().split()))
  for i in range(len(l)):
    d[l[i]] = i+1
  result = ""
  for i in range(len(l)):
    result = result + str(d[i+1]) + " "
  print(result.rstrip())

main()

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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


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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
St=input().split()
num=1
out=''
for i in range(N):
  St[i]=int(St[i])
while num<=N:
  for i in range(N):
    if St[i] ==num:
      out=out+str(i+1)+' '
      num+=1
print(out)

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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


for i in range(N):
    output.append((order.index(i+1))+1)
print(' '.join(map(str,output)))

Submission status: Time Limit Exceeded

Solution code:
def main():
    N = input()
    L = [int(i) for i in input().split()]
    dL = list(L)

    for i in range(len(L)):
        minL = min(L)
        print(dL.index(minL) + 1, end = " ")
        L.remove(minL)

if __name__ == "__main__":
    main()

Submission status: Time Limit Exceeded

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

    sL = sorted(L)
    ans = []

    for num in sL:
        print(L.index(num) + 1, end=" ")

if __name__ == "__main__":
    main()

Submission status: Time Limit Exceeded

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

    sL = sorted(L)

    ans = []
    
    sL = sorted(L)
    for num in sL:
        print(L.index(num) + 1, end=" ")

if __name__ == "__main__":
    main()

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

Submission status: Time Limit Exceeded

Solution code:
N = int(input())

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

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

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

Submission status: Time Limit Exceeded

Solution code:
N = int(input())

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

# ans = [A_list.index(i+1)+1 for i in range(N)]
#
# print(ans)

for i in range(N):
    print(A_list.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):
    for j in range(0,n):
        if a[j] == i:
            b.append(j+1)
print(*b)