import sys
from collections import deque
import numpy as np
import math
sys.setrecursionlimit(10**6)
def S(): return sys.stdin.readline().rstrip()
def SL(): return map(str,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def IL(): return map(int,sys.stdin.readline().rstrip().split())

def solve():
    la = [(item,i+1) for i,item in enumerate(a)]
    la.sort()
    for rep in la:
        print(f"{rep[1]} ",end="")
    return

if __name__=='__main__':
    n = I()
    a = list(IL())
    solve() import sys sys from collections import deque import numpy as np numpy import math math sys.setrecursionlimit(10**6) sys.setrecursionlimit sys setrecursionlimit 10**6 10 6 def S(): return sys.stdin.readline().rstrip() S def SL(): return map(str,sys.stdin.readline().rstrip().split()) SL def I(): return int(sys.stdin.readline().rstrip()) I def IL(): return map(int,sys.stdin.readline().rstrip().split()) IL def solve():
    la = [(item,i+1) for i,item in enumerate(a)]
    la.sort()
    for rep in la:
        print(f"{rep[1]} ",end="")
    return solve (item,i+1) for i,item in enumerate(a) for i,item in enumerate(a) i item enumerate(a) enumerate a for i,item in enumerate(a) (item,i+1) item i+1 i 1 la = [(item,i+1) for i,item in enumerate(a)] la [(item,i+1) for i,item in enumerate(a)] la.sort() la.sort la sort for rep in la:
        print(f"{rep[1]} ",end="")
     rep la print(f"{rep[1]} ",end="") print f"{rep[1]} " end="" end "" return if __name__=='__main__':
    n = I()
    a = list(IL())
    solve() __name__=='__main__' __name__ '__main__' n = I() n I() I a = list(IL()) a list(IL()) list IL() IL solve() solve def I(): return int(sys.stdin.readline().rstrip()) def I(): return int(sys.stdin.readline().rstrip()) I a = list(IL()) list(IL()) a def IL(): return map(int,sys.stdin.readline().rstrip().split()) def IL(): return map(int,sys.stdin.readline().rstrip().split()) IL def S(): return sys.stdin.readline().rstrip() def S(): return sys.stdin.readline().rstrip() S def solve():
    la = [(item,i+1) for i,item in enumerate(a)]
    la.sort()
    for rep in la:
        print(f"{rep[1]} ",end="")
    return def solve():
    la = [(item,i+1) for i,item in enumerate(a)]
    la.sort()
    for rep in la:
        print(f"{rep[1]} ",end="")
    return solve def SL(): return map(str,sys.stdin.readline().rstrip().split()) def SL(): return map(str,sys.stdin.readline().rstrip().split()) SL n = I() I() n
import sys
from collections import deque
import numpy as np
import math
sys.setrecursionlimit(10**6)
def S(): return sys.stdin.readline().rstrip()
def SL(): return map(str,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def IL(): return map(int,sys.stdin.readline().rstrip().split())

def solve():
    la = [(item,i+1) for i,item in enumerate(a)]
    la.sort()
    for rep in la:
        print(f"{rep[1]} ",end="")
    return

if __name__=='__main__':
    n = I()
    a = list(IL())
    solve()