import sys

# import bisect
# import numpy as np
# from collections import deque
from collections import deque
# map(int, sys.stdin.read().split())
# import heapq
#import bisect
#import math


def input():
    return sys.stdin.readline().rstrip()


def main():
    N = int(input())
    A = list(map(int, input().split()))
    l = list()
    for i in range(N):
        l.append((A[i],i+1))
    l.sort()
    for i in range(N):
        print(l[i][1],end=" ")

if __name__ == "__main__":
    main() import sys sys from collections import deque def input():
    return sys.stdin.readline().rstrip() input return sys.stdin.readline().rstrip() sys.stdin.readline().rstrip() sys.stdin.readline().rstrip sys.stdin.readline() sys.stdin.readline sys.stdin sys stdin readline rstrip def main():
    N = int(input())
    A = list(map(int, input().split()))
    l = list()
    for i in range(N):
        l.append((A[i],i+1))
    l.sort()
    for i in range(N):
        print(l[i][1],end=" ") 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 l = list() l list() list for i in range(N):
        l.append((A[i],i+1))
     i range(N) range N l.append((A[i],i+1)) l.append l append (A[i],i+1) A[i] A i i+1 i 1 l.sort() l.sort l sort for i in range(N):
        print(l[i][1],end=" ") i range(N) range N print(l[i][1],end=" ") print l[i][1] [i] l i 1 end=" " end " " if __name__ == "__main__":
    main() __name__ == "__main__" __name__ "__main__" main() main def main():
    N = int(input())
    A = list(map(int, input().split()))
    l = list()
    for i in range(N):
        l.append((A[i],i+1))
    l.sort()
    for i in range(N):
        print(l[i][1],end=" ") def main():
    N = int(input())
    A = list(map(int, input().split()))
    l = list()
    for i in range(N):
        l.append((A[i],i+1))
    l.sort()
    for i in range(N):
        print(l[i][1],end=" ") main def input():
    return sys.stdin.readline().rstrip() def input():
    return sys.stdin.readline().rstrip() input
import sys

# import bisect
# import numpy as np
# from collections import deque
from collections import deque
# map(int, sys.stdin.read().split())
# import heapq
#import bisect
#import math


def input():
    return sys.stdin.readline().rstrip()


def main():
    N = int(input())
    A = list(map(int, input().split()))
    l = list()
    for i in range(N):
        l.append((A[i],i+1))
    l.sort()
    for i in range(N):
        print(l[i][1],end=" ")

if __name__ == "__main__":
    main()
