#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(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 fractions import gcd from itertools import combinations,permutations,accumulate from collections import deque,defaultdict,Counter import decimal decimal import re re import sys sys sys.setrecursionlimit(10000000) sys.setrecursionlimit sys setrecursionlimit 10000000 mod = 10**9 + 7 mod 10**9 + 7 10**9 10 9 7 def readInts():
  return list(map(int,input().split())) readInts return list(map(int,input().split())) list(map(int,input().split())) list map(int,input().split()) map int input().split() ().split () input split def I():
  return int(input()) I return int(input()) int(input()) int input() input n = I() n I() I A = readInts() A readInts() readInts nya = [] nya [] for i in range(n):
    nya.append((i+1,A[i])) i range(n) range n nya.append((i+1,A[i])) nya.append nya append (i+1,A[i]) i+1 i 1 A[i] A i nya = sorted(nya,key = lambda x:x[1]) nya sorted(nya,key = lambda x:x[1]) sorted nya key = lambda x:x[1] key lambda x:x[1] x[1] x 1 x ans = [] ans [] for (idx,po) in nya:
    ans.append(idx) (idx,po) idx po nya ans.append(idx) ans.append ans append idx print(*ans) print *ans ans A = readInts() readInts() A nya = [] [] nya nya = sorted(nya,key = lambda x:x[1]) sorted(nya,key = lambda x:x[1]) nya def readInts():
  return list(map(int,input().split())) def readInts():
  return list(map(int,input().split())) readInts n = I() I() n def I():
  return int(input()) def I():
  return int(input()) I ans = [] [] ans mod = 10**9 + 7 10**9 + 7 mod
#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(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)
