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()))
res = []
for i in range(1,n+1):
  res.append(a.index(i)+1)
print(*res)

Submission status: Time Limit Exceeded

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

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

Ans2=(" ").join(Ans)
print(Ans2)

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

l = len(A)

for i in range(l):
    print(A.index(i+1)+1, end='')
    if i == l - 1:
        print()
    else:
        print(' ', 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='')
    if i == len(A) - 1:
        print()
    else:
        print(' ', end='')

Submission status: Time Limit Exceeded

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

print(*ans, sep=" ")

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
*A, = 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(' ')))

students = []

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

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

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:
import heapq

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

A_heap = A[:]
heapq.heapify(A_heap)

ans = []
for i in range(N):
    ans.append(A.index(heapq.heappop(A_heap)) + 1)
print(*ans)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

ans = [0] * N

for i in range(N):
    num = A.index(i+1) + 1
    ans[i] = str(num) + " "

s = "".join(ans)

print(s)

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = list(map(int,input().split()))
b = [0 for j in range(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 for i in range(n)]

for i in range(1,n+1): #1~nについて
    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): #1~nについて
    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): #1~nについて
    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()))
b = []

for i in range(1,n+1):
  for j in range(n):
    if a[j] == i:
      b.append(a.index(i) + 1)
      break
      
print(' '.join(map(str, b)))

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
A=list(map(int,input().split()))
B=sorted(A)
ans=[]
for i in range(N):
  mnum=A.index(B[i])
  ans.append(mnum+1)
for i in ans:
  print(i,end=" ")

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
import numpy as np
n = int(input())
a = np.array(list(map(int, input().split())))
for i in range(1, n+1):
    out = int(np.where(a == i)[0])
    if i < n:
        print(out + 1, end=' ')
    else:
        print(out + 1)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

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

print(" ".join(ans))

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
import numpy as np

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:
import numpy as np

N = int(input())
A = list(map(int, input().split()))
dic = {i:A.index(i)+1 for i in A}

print(' '.join([str(e[1]) for e in sorted(dic.items())]))

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()))
ans = []
for i in range(n):
    ans.append(a.index(i+1)+1)
print(*ans)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

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(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()))
A_ = sorted(A)
for i in range(N):
  A_[i] = (str(A.index(A_[i])+1))
print(' '.join(A_))

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
import sys
input = sys.stdin.readline
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(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):
  for j in range(N):
    if i == A[j]:
      B.append(str(j+1))
print(' '.join(B))

Submission status: Time Limit Exceeded

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

print(*b[0])

Submission status: Time Limit Exceeded

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

b = list(a.index(i+1)+1 for i in range(n))

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

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):
    B.append(A.index(i)+1)
ans = ' '.join(map(str,B))
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 (1,n+1):
  for j in range (n):
    if l[j]==i:
      ans[i-1]=j+1
      break
      
print(*ans)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

B.sort()
for i in (B):
  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 (A):
  B.append(i)

B.sort()
for i in (B):
  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("{:}".format(A.index(i+1)+1),end=" ")

Submission status: Time Limit Exceeded

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

sum=1


for i in range(1,N+1):
    for j in range(1,N+1):
        if A[j-1]==sum:
            print(j,end=" ")
            sum+=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) 
print(' '.join(map(str, B)))

Submission status: Time Limit Exceeded

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

out=[]
for i in range(N):
    dammy = ls_A.index(min(ls_A))
    out.append(dammy+1)
    ls_A[dammy] = N+3   #何よりも大きい数値にする
out=' '.join(map(str,out))
print(out)

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
a=[int(x) for x in input().split()]
cnt=1
ans=[]
for j in range(1,n+1):
	for i in a:
		if j==i:
			ans.append(a.index(i)+1)
			cnt+=1
for i in ans:
	print(i)

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
a=[int(x) for x in input().split()]
cnt=1
ans=[]
while cnt<=n:
	for i in a:
		if cnt==i:
			ans.append(a.index(i)+1)
			cnt+=1
for i in ans:
	print(i)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

ans = [0 for i in range(n)]
c = 0
c1 = n+1
for i in range(n//2+1) :
  f = 0
  f1 = 0
  c += 1
  c1 -= 1
  for j in range(n) :
    if a[j] == c :
      ans[c-1] = j + 1
      f = 1
    if a[j] == c1 :
      ans[c1-1] = j + 1
      f1 = 1
    if f == 1 and f1 == 1 :
      break
print(*ans)

Submission status: Time Limit Exceeded

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

ans = [0 for i in range(n)]
c = 0
c1 = n
for i in range(n) :
  f = 0
  f1 = 0
  c += 1
  for j in range(n) :
    if a[j] == c :
      ans[c-1] = j + 1
      f = 1
    if a[j] == c1 :
      ans[c1-1] = j + 1
      f1 = 1
    if f == 1 and f1 == 1 :
      break
print(*ans)

Submission status: Time Limit Exceeded

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

ans = [0 for i in range(n)]
c = 0
for i in range(n) :
  c += 1
  for j in range(n) :
    if a[j] == c :
      ans[c-1] = j + 1
      break

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):
  x = A.index(i)
  ans += (str(x+1) + ' ')
print(ans)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

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()))
l=[]

for i in range(n+1):
    for j, _ in enumerate(a):
        if i==a[j]:
            l.append(str(j+1))
print(' '.join(l))

Submission status: Time Limit Exceeded

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

for i in range(1,n+1):
    l.append(str(a.index(i)+1))
    
print(' '.join(l))

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()))
l=[]
sorted(a)
for i in range(1,n+1):
    l.append(str(a.index(i)+1))
print(' '.join(l))
#loopを一つ減らしたがTLE

Submission status: Time Limit Exceeded

Solution code:
from sys import stdin

n = int(stdin.readline().rstrip())
a = [int(x) for x in stdin.readline().rstrip().split()]

a_n = []
for i in range(1, n + 1):
    a_i = a.index(i) + 1
    a_n.append(a_i)

print(*a_n)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

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

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:
# #!/usr/bin/env python3
# # -*- coding: utf-8 -*-


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


if __name__ == "__main__":
    main()

Submission status: Time Limit Exceeded

Solution code:
# #!/usr/bin/env python3
# # -*- coding: utf-8 -*-


def main():
    N = int(input())
    S = list(map(int, input().split()))

    result = []

    for i in range(N):
        result.append(S.index(i + 1) + 1)

    print(*result)


if __name__ == "__main__":
    main()

Submission status: Time Limit Exceeded

Solution code:
#ABC 142C
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=tuple(map(int,input().split()))

a=[]

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

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

Submission status: Time Limit Exceeded

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

a=[]

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

Submission status: Time Limit Exceeded

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

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

print(" ".join(ans))

Submission status: Time Limit Exceeded

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

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

print(" ".join(ans))

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

for i in range(n):
    for j in range(n):
        if a_lst[j]==i+1:
            seq_lst.append(j+1)
            break

for i in range(n):
    print(seq_lst[i],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):
    stu = A.index(i) + 1
    S.append(stu)

S = [str(S[i]) for i in range (N)]
print(' '.join(S))

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
A=list(map(int,input().split()))
for i in range(0, 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=[i+1 for i in range(0, N)]
for i in range(0, N):
    print(A.index(B[i])+1,end=" ")

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

A= [int(a) for a in A]
A_sorted = sorted(A)

ans = ''
for i in A_sorted:
  ans += str(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(1,n+1):
    print(a.index(i)+1,end=' ')

Submission status: Time Limit Exceeded

Solution code:
"""
author : halo2halo
date : 4, Feb, 2020
"""

import sys

# import numpy as np

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

N, *A = map(int, read().split())
B = sorted(A)
ans=[]
for i in B:
    ans.append(A.index(i)+1)
print(*ans, sep=' ')

Submission status: Time Limit Exceeded

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

ans=[None]*N
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=[None]*N
for i in range(N):
    ans[i]=A.index(i+1)+1
for i in range(N):
     print(ans[i],end=' ')

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
an = [int(i) for i in input().split()]
order = [an.index(i + 1) + 1 for i in range(n)]
for i in range(n - 1):
    print(str(order[i]), end=' ')
print(order[n - 1])

Submission status: Time Limit Exceeded

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

li2 = sorted(li)
ans = [(li.index(li2[i]) + 1) for i in range(n)]

print(*ans)

Submission status: Time Limit Exceeded

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

li2 = sorted(li)
ans = []

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

print(*ans)

Submission status: Time Limit Exceeded

Solution code:
import sys

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

def main():
	N = II()
	A = LI()
	order = [0]*N
	for i,a in enumerate(A):
		order[a-1] = i+1
	ans = ""
	for a in order:
		ans += (str(a)+" ")

	print(ans[:-1])

main()

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
a = ""
student = list(map(int,input().split()))
for i in range(N):
    a += " " + str(student.index(i+1) + 1)
a = list(a.split(" "))
a.pop(0)
print(" ".join(a))

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

for i in range(n):
    print(h.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())
people_count = list(map(int, input().split()))

for order in range(1, n+1):
    people = people_count.index(order) + 1
    print(people, end=" ")

Submission status: Time Limit Exceeded

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

order_sort = [i for i in range(1, n+1)]
for order in order_sort:
    people = people_count.index(order) + 1
    print(people, end=" ")

Submission status: Time Limit Exceeded

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

order_sort = sorted(people_count)
for order in order_sort:
    people = people_count.index(order) + 1
    print(people, end=" ")

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
L = [_ for _ in 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:
N = int(input())
L = [_ for _ in map(int,input().split())]
res = [L.index(i)+1 for i in range(1,N+1)]
print(' '.join(map(str, res)))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
L = [_ for _ in map(int,input().split())]
res = []
for i in range(1,N+1):
    #index iを表示していく。
    student = L.index(i)+1
    res.append(student)
print(' '.join(map(str, res)))

Submission status: Time Limit Exceeded

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

for i in range(1,n+1):
    ans[i-1] = str(array.index(i) + 1)



print(" ".join(ans))

Submission status: Time Limit Exceeded

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

for i in range(1,n+1):
    ans[i-1] = array.index(i) + 1



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

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

    #answer_list = [0] * len(A_list)
    answer_list = []

    for i in range(len(A_list)):
        answer_list.append(A_list.index(i+1)+1)

    for a in answer_list:
        print(a, end=' ')

if __name__ == "__main__":
    resolve()

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

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

for i in range(n - 1):
    print(str(order[i]), end=' ')
print(order[n - 1])

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
li = list(map(int, input().split()))
l = list()
for i in range(n):
    l.append(li.index(min(li)) + 1)
    li[li.index(min(li))] = 999999

print(*l)

Submission status: Time Limit Exceeded

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

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

print(*ans)