# import sys
# sys.setrecursionlimit(10 ** 6)
# import bisect
# from collections import deque
# from decorator import stop_watch
# 
# 
# @stop_watch
def solve(N, As):
    students = [(As[i], i) for i in range(N)]
    students.sort()
    ans = ''
    for n, s in students:
        ans += ' ' + str(s + 1)
    print(ans.strip())


if __name__ == '__main__':
    # S = input()
    N = int(input())
    # N, M = map(int, input().split())
    As = [int(i) for i in input().split()]
    # Bs = [int(i) for i in input().split()]
    solve(N, As) def solve(N, As):
    students = [(As[i], i) for i in range(N)]
    students.sort()
    ans = ''
    for n, s in students:
        ans += ' ' + str(s + 1)
    print(ans.strip()) solve (As[i], i) for i in range(N) for i in range(N) i range(N) range N for i in range(N) (As[i], i) As[i] As i i students = [(As[i], i) for i in range(N)] students [(As[i], i) for i in range(N)] students.sort() students.sort students sort ans = '' ans '' for n, s in students:
        ans += ' ' + str(s + 1)
     n s students ans += ' ' + str(s + 1) ans ' ' + str(s + 1) ' ' str(s + 1) str s + 1 s 1 print(ans.strip()) print ans.strip() ans.strip ans strip N N As As if __name__ == '__main__':
    # S = input()
    N = int(input())
    # N, M = map(int, input().split())
    As = [int(i) for i in input().split()]
    # Bs = [int(i) for i in input().split()]
    solve(N, As) __name__ == '__main__' __name__ '__main__' N = int(input()) N int(input()) int input() input int(i) for i in input().split() for i in input().split() i input().split() ().split () input split for i in input().split() int(i) int i As = [int(i) for i in input().split()] As [int(i) for i in input().split()] solve(N, As) solve N As N = int(input()) int(input()) N def solve(N, As):
    students = [(As[i], i) for i in range(N)]
    students.sort()
    ans = ''
    for n, s in students:
        ans += ' ' + str(s + 1)
    print(ans.strip()) def solve(N, As):
    students = [(As[i], i) for i in range(N)]
    students.sort()
    ans = ''
    for n, s in students:
        ans += ' ' + str(s + 1)
    print(ans.strip()) solve As = [int(i) for i in input().split()] [int(i) for i in input().split()] As
# import sys
# sys.setrecursionlimit(10 ** 6)
# import bisect
# from collections import deque
# from decorator import stop_watch
# 
# 
# @stop_watch
def solve(N, As):
    students = [(As[i], i) for i in range(N)]
    students.sort()
    ans = ''
    for n, s in students:
        ans += ' ' + str(s + 1)
    print(ans.strip())


if __name__ == '__main__':
    # S = input()
    N = int(input())
    # N, M = map(int, input().split())
    As = [int(i) for i in input().split()]
    # Bs = [int(i) for i in input().split()]
    solve(N, As)
