#from statistics import median

#import collections

#aa = collections.Counter(a) # list to list

#from itertools import combinations # (string,3) 3回

#

#

# pythonで無理なときは、pypyでやると正解するかも！！

#

#



mod = 10**9 + 7



def readInts():

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

def main():

    n = int(eval(input()))

    A = list(zip(list(map(int,input().split())), list(range(1,n+1))))

    print((*[a[1] for a in sorted(A)]))

if __name__ == '__main__':

  main()

#from statistics import median

#import collections

#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]

from fractions import gcd

from itertools import combinations,permutations,accumulate # (string,3) 3回

#from collections import deque

from collections import deque,defaultdict,Counter

import decimal

import re

#import bisect

#

#    d = m - k[i] - k[j]

#    if kk[bisect.bisect_right(kk,d) - 1] == d:

#

#

#

# pythonで無理なときは、pypyでやると正解するかも！！

#

#

# my_round_int = lambda x:np.round((x*2 + 1)//2)

# 四捨五入

import sys

sys.setrecursionlimit(10000000)

mod = 10**9 + 7

#mod = 9982443453

def readInts():

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

def I():

  return int(eval(input()))

n = I()

A = readInts()

nya = []

for i in range(n):

    nya.append((i+1,A[i]))

nya = sorted(nya,key = lambda x:x[1])

ans = []

for (idx,po) in nya:

    ans.append(idx)

print((*ans))

# from statistics import median
# import collections
# aa = collections.Counter(a) # list to list
# from itertools import combinations # (string,3) 3回
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#
mod = 10**9 + 7


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


def main():
    n = int(eval(input()))
    A = list(zip(list(map(int, input().split())), list(range(1, n + 1))))
    print((*[a[1] for a in sorted(A)]))


if __name__ == "__main__":
    main()

# from statistics import median
# import collections
# aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations, permutations, accumulate  # (string,3) 3回

# from collections import deque
from collections import deque, defaultdict, Counter
import decimal
import re

# import bisect
#
#    d = m - k[i] - k[j]
#    if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#
# my_round_int = lambda x:np.round((x*2 + 1)//2)
# 四捨五入
import sys

sys.setrecursionlimit(10000000)
mod = 10**9 + 7
# mod = 9982443453
def readInts():
    return list(map(int, input().split()))


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


n = I()
A = readInts()
nya = []
for i in range(n):
    nya.append((i + 1, A[i]))
nya = sorted(nya, key=lambda x: x[1])
ans = []
for (idx, po) in nya:
    ans.append(idx)
print((*ans))

-# aa = collections.Counter(a) # list to list -# from itertools import combinations # (string,3) 3回 +# aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0] +from fractions import gcd +from itertools import combinations, permutations, accumulate  # (string,3) 3回 + +# from collections import deque +from collections import deque, defaultdict, Counter +import decimal +import re + +# import bisect +# +#    d = m - k[i] - k[j] +#    if kk[bisect.bisect_right(kk,d) - 1] == d: +# +# my_round_int = lambda x:np.round((x*2 + 1)//2) +# 四捨五入 +import sys + +sys.setrecursionlimit(10000000) - - +# mod = 9982443453 -def main(): -    n = int(eval(input())) -    A = list(zip(list(map(int, input().split())), list(range(1, n + 1)))) -    print((*[a[1] for a in sorted(A)])) +def I(): +    return int(eval(input())) -if __name__ == "__main__": -    main() +n = I() +A = readInts() +nya = [] +for i in range(n): +    nya.append((i + 1, A[i])) +nya = sorted(nya, key=lambda x: x[1]) +ans = [] +for (idx, po) in nya: +    ans.append(idx) +print((*ans))