from collections import Counter,defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right 
import sys,math,itertools,fractions
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))

n = inp()
a = inpl()
res = [0] * n
for i,x in enumerate(a):
    res[x-1] = i+1
print(*res) from collections import Counter,defaultdict,deque from heapq import heappop,heappush from bisect import bisect_left,bisect_right import sys,math,itertools,fractions sys math itertools fractions sys.setrecursionlimit(10**8) sys.setrecursionlimit sys setrecursionlimit 10**8 10 8 mod = 10**9+7 mod 10**9+7 10**9 10 9 7 INF = float('inf') INF float('inf') float 'inf' def inp(): return int(sys.stdin.readline()) inp def inpl(): return list(map(int, sys.stdin.readline().split())) inpl n = inp() n inp() inp a = inpl() a inpl() inpl res = [0] * n res [0] * n [0] 0 n for i,x in enumerate(a):
    res[x-1] = i+1 i x enumerate(a) enumerate a res[x-1] = i+1 res[x-1] res x-1 x 1 i+1 i 1 print(*res) print *res res INF = float('inf') float('inf') INF n = inp() inp() n res = [0] * n [0] * n res a = inpl() inpl() a mod = 10**9+7 10**9+7 mod def inpl(): return list(map(int, sys.stdin.readline().split())) def inpl(): return list(map(int, sys.stdin.readline().split())) inpl def inp(): return int(sys.stdin.readline()) def inp(): return int(sys.stdin.readline()) inp
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right 
import sys,math,itertools,fractions
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))

n = inp()
a = inpl()
res = [0] * n
for i,x in enumerate(a):
    res[x-1] = i+1
print(*res)
