
def solve():
    dp = [0] * N
    for i in range(N):
        dp[A[i]-1] = i+1
    for i in range(N):
        print(dp[i], end=" ")


if __name__ == "__main__":
    N = int(input())
    A = list(map(int, input().split()))
    solve()   def solve():
    dp = [0] * N
    for i in range(N):
        dp[A[i]-1] = i+1
    for i in range(N):
        print(dp[i], end=" ") solve dp = [0] * N dp [0] * N [0] 0 N for i in range(N):
        dp[A[i]-1] = i+1
     i range(N) range N dp[A[i]-1] = i+1 dp[A[i]-1] dp A[i]-1 A[i] A i 1 i+1 i 1 for i in range(N):
        print(dp[i], end=" ") i range(N) range N print(dp[i], end=" ") print dp[i] dp i end=" " end " " if __name__ == "__main__":
    N = int(input())
    A = list(map(int, input().split()))
    solve()   __name__ == "__main__" __name__ "__main__" N = int(input()) N int(input()) int input() input A = list(map(int, input().split())) A list(map(int, input().split())) list map(int, input().split()) map int input().split() ().split () input split solve() solve N = int(input()) int(input()) N A = list(map(int, input().split())) list(map(int, input().split())) A def solve():
    dp = [0] * N
    for i in range(N):
        dp[A[i]-1] = i+1
    for i in range(N):
        print(dp[i], end=" ") def solve():
    dp = [0] * N
    for i in range(N):
        dp[A[i]-1] = i+1
    for i in range(N):
        print(dp[i], end=" ") solve

def solve():
    dp = [0] * N
    for i in range(N):
        dp[A[i]-1] = i+1
    for i in range(N):
        print(dp[i], end=" ")


if __name__ == "__main__":
    N = int(input())
    A = list(map(int, input().split()))
    solve()  
