import sys, bisect, math, itertools, string, queue, copy
# import numpy as np
# import scipy
# from collections import Counter,defaultdict,deque
# from itertools import permutations, combinations
# from heapq import heappop, heappush
# # input = sys.stdin.readline
# sys.setrecursionlimit(10**8)
# mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

n = inp()
l = inpl()
dic = {}
for i in range(0, len(l)):
    dic.setdefault(i, l[i])
sl = sorted(dic.items(), key=lambda x:x[1])
ans=[str(x[0] + 1) for x in sl]
print(' '.join(ans)) import sys, bisect, math, itertools, string, queue, copy sys bisect math itertools string queue copy def inp(): return int(input()) inp def inpm(): return map(int,input().split()) inpm def inpl(): return list(map(int, input().split())) inpl def inpls(): return list(input().split()) inpls def inplm(n): return list(int(input()) for _ in range(n)) inplm n n list(input()) for _ in range(n) for _ in range(n) _ range(n) range n for _ in range(n) list(input()) list input() input def inplL(n): return [list(input()) for _ in range(n)] inplL n n tuple(input()) for _ in range(n) for _ in range(n) _ range(n) range n for _ in range(n) tuple(input()) tuple input() input def inplT(n): return [tuple(input()) for _ in range(n)] inplT n n list(map(int, input().split())) for _ in range(n) for _ in range(n) _ range(n) range n for _ in range(n) list(map(int, input().split())) list map(int, input().split()) map int input().split() ().split () input split def inpll(n): return [list(map(int, input().split())) for _ in range(n)] inpll n n list(map(int, input().split())) for _ in range(n) for _ in range(n) _ range(n) range n for _ in range(n) list(map(int, input().split())) list map(int, input().split()) map int input().split() ().split () input split def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)]) inplls n n n = inp() n inp() inp l = inpl() l inpl() inpl dic = {} dic {} for i in range(0, len(l)):
    dic.setdefault(i, l[i]) i range(0, len(l)) range 0 len(l) len l dic.setdefault(i, l[i]) dic.setdefault dic setdefault i l[i] l i sl = sorted(dic.items(), key=lambda x:x[1]) sl sorted(dic.items(), key=lambda x:x[1]) sorted dic.items() dic.items dic items key=lambda x:x[1] key lambda x:x[1] x[1] x 1 x str(x[0] + 1) for x in sl for x in sl x sl for x in sl str(x[0] + 1) str x[0] + 1 x[0] x 0 1 ans=[str(x[0] + 1) for x in sl] ans [str(x[0] + 1) for x in sl] print(' '.join(ans)) print ' '.join(ans) ' '.join ' ' join ans def inpl(): return list(map(int, input().split())) def inpl(): return list(map(int, input().split())) inpl def inplm(n): return list(int(input()) for _ in range(n)) def inplm(n): return list(int(input()) for _ in range(n)) inplm def inpll(n): return [list(map(int, input().split())) for _ in range(n)] def inpll(n): return [list(map(int, input().split())) for _ in range(n)] inpll def inplT(n): return [tuple(input()) for _ in range(n)] def inplT(n): return [tuple(input()) for _ in range(n)] inplT ans=[str(x[0] + 1) for x in sl] [str(x[0] + 1) for x in sl] ans l = inpl() inpl() l def inpls(): return list(input().split()) def inpls(): return list(input().split()) inpls def inp(): return int(input()) def inp(): return int(input()) inp def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)]) def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)]) inplls sl = sorted(dic.items(), key=lambda x:x[1]) sorted(dic.items(), key=lambda x:x[1]) sl def inplL(n): return [list(input()) for _ in range(n)] def inplL(n): return [list(input()) for _ in range(n)] inplL dic = {} {} dic def inpm(): return map(int,input().split()) def inpm(): return map(int,input().split()) inpm n = inp() inp() n
import sys, bisect, math, itertools, string, queue, copy
# import numpy as np
# import scipy
# from collections import Counter,defaultdict,deque
# from itertools import permutations, combinations
# from heapq import heappop, heappush
# # input = sys.stdin.readline
# sys.setrecursionlimit(10**8)
# mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

n = inp()
l = inpl()
dic = {}
for i in range(0, len(l)):
    dic.setdefault(i, l[i])
sl = sorted(dic.items(), key=lambda x:x[1])
ans=[str(x[0] + 1) for x in sl]
print(' '.join(ans))
