from collections import deque



N = int(eval(input()))

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

A = list(enumerate(A))

A.sort(key = lambda x: x[1])



ans = deque()



for a in A:

    ans.append(a[0] + 1)



print((" ".join(map(str, ans))))
def INT():

    return int(eval(input()))



def MI():

    return list(map(int, input().split()))



def LI():

    return list(map(int, input().split()))



N = INT()

A = LI()



for i in range(N):

    A[i] = [i + 1, A[i]]

    

A.sort(key = lambda x : x[1])



ans = []



for i in range(N):

    ans.append(A[i][0])

    

print((*ans))
from collections import deque

N = int(eval(input()))
A = list(map(int, input().split()))
A = list(enumerate(A))
A.sort(key=lambda x: x[1])
ans = deque()
for a in A:
    ans.append(a[0] + 1)
print((" ".join(map(str, ans))))

def INT():
    return int(eval(input()))


def MI():
    return list(map(int, input().split()))


def LI():
    return list(map(int, input().split()))


N = INT()
A = LI()
for i in range(N):
    A[i] = [i + 1, A[i]]
A.sort(key=lambda x: x[1])
ans = []
for i in range(N):
    ans.append(A[i][0])
print((*ans))

-from collections import deque +def INT(): +    return int(eval(input())) -N = int(eval(input())) -A = list(map(int, input().split())) -A = list(enumerate(A)) + +def MI(): +    return list(map(int, input().split())) + + +def LI(): +    return list(map(int, input().split())) + + +N = INT() +A = LI() +for i in range(N): +    A[i] = [i + 1, A[i]] -ans = deque() -for a in A: -    ans.append(a[0] + 1) -print((" ".join(map(str, ans)))) +ans = [] +for i in range(N): +    ans.append(A[i][0]) +print((*ans))