Buggy python submission (verdict: Time Limit Exceeded):
import sys
import numpy as np
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)

Fixed submission:
N = int(input())
A = list(map(int,input().split()))
L = [[] for i in range(N)]
for i in range(N):
    L[i] = [A[i], i+1]
L = sorted(L)
for i in range(N):
    print(L[i][1])

Buggy python submission (verdict: Time Limit Exceeded):
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)


Fixed submission:
N = int(input())
A = list(map(int,input().split()))
L = [[] for i in range(N)]
for i in range(N):
    L[i] = [A[i], i+1]
L = sorted(L)
for i in range(N):
    print(L[i][1])

Buggy python submission (verdict: Time Limit Exceeded):
import numpy as np
N = int(input())
A = input().split()

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

Fixed submission:
N = int(input())
A = list(map(int,input().split()))
L = [[] for i in range(N)]
for i in range(N):
    L[i] = [A[i], i+1]
L = sorted(L)
for i in range(N):
    print(L[i][1])

Buggy python submission (verdict: Time Limit Exceeded):
import numpy as np
N = int(input())
A = input().split()
A = [int(s) for s in A]

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


Fixed submission:
N = int(input())
A = list(map(int,input().split()))
L = [[] for i in range(N)]
for i in range(N):
    L[i] = [A[i], i+1]
L = sorted(L)
for i in range(N):
    print(L[i][1])

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = input().split()
A = [int(s) for s in A]
i = 0
j = 1
while j <= N:
    if j==A[i]:
        print(i+1)
        i = 0
        j = j + 1
    else:
        i = i + 1


Fixed submission:
N = int(input())
A = list(map(int,input().split()))
L = [[] for i in range(N)]
for i in range(N):
    L[i] = [A[i], i+1]
L = sorted(L)
for i in range(N):
    print(L[i][1])

Buggy python submission (verdict: Runtime Error):
N = int(input())
A = input().split()
A = [int(s) for s in A]
j = 1
while j < N:
    if j==A[i]:
        print(i)
        i = 0
        j = j + 1
    i = i + 1


Fixed submission:
N = int(input())
A = list(map(int,input().split()))
L = [[] for i in range(N)]
for i in range(N):
    L[i] = [A[i], i+1]
L = sorted(L)
for i in range(N):
    print(L[i][1])

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = input().split()
A = [int(s) for s in A]
A_sort = sorted(A)
for a_sort in A_sort:
    for i, a in enumerate(A):
        if a_sort == a:
            print(i+1)
            break
    

Fixed submission:
N = int(input())
A = list(map(int,input().split()))
L = [[] for i in range(N)]
for i in range(N):
    L[i] = [A[i], i+1]
L = sorted(L)
for i in range(N):
    print(L[i][1])

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = input().split()
A = [int(s) for s in A]
students = []
A_sort = sorted(A)
for a_sort in A_sort:
    for i, a in enumerate(A):
        if a_sort == a:
            print(i+1)
            break
    

Fixed submission:
N = int(input())
A = list(map(int,input().split()))
L = [[] for i in range(N)]
for i in range(N):
    L[i] = [A[i], i+1]
L = sorted(L)
for i in range(N):
    print(L[i][1])