Problem:
 Score : 300 points    Problem Statement  Takahashi is a teacher responsible for a class of N students.  The students are given distinct student numbers from 1 to N .  Today, all the students entered the classroom at different times.  According to Takahashi's record, there were A_i students in the classroom when student number i entered the classroom (including student number i ).  From these records, reconstruct the order in which the students entered the classroom.      Constraints   1 \le N \le 10^5  1 \le A_i \le N  A_i \neq A_j  (i \neq j)  All values in input are integers.         Input  Input is given from Standard Input in the following format:  N  A_1  A_2  \ldots  A_N       Output  Print the student numbers of the students in the order the students entered the classroom.        Sample Input 1 3
2 3 1      Sample Output 1 3 1 2  First, student number 3 entered the classroom.  Then, student number 1 entered the classroom.  Finally, student number 2 entered the classroom.       Sample Input 2 5
1 2 3 4 5      Sample Output 2 1 2 3 4 5       Sample Input 3 8
8 2 7 3 4 5 6 1      Sample Output 3 8 2 4 5 6 7 3 1

Solution (Python):
import sys

def input(): return sys.stdin.readline()[:-1]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def MATINT(h): return [list(map(int, input().split())) for _ in range(h)]
def MATSTR(h): return [input() for _ in range(h)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
inf = float('inf')
mod = 10 ** 9 + 7

N = INT()
A_ = LIST()
A = sorted([[A_[i], i+1] for i in range(N)])

B = [A[i][1] for i in range(N)]

print(*B)

Solution (Python):
n = int(input())
l = [[i,0] for i in range(1,n+1)]
a = list(map(int,input().split()))
for i in range(n):
  l[i][1] = a[i]
l.sort(key=lambda x:x[1])
for i in range(n):
  print(l[i][0],end = " ")

Solution (Python):


import sys
import math
import collections
import itertools
from inspect import currentframe
INF = 10 ** 10
MOD = 10 ** 9 + 7
def input() : return sys.stdin.readline().strip()
def gcd(x, y) : return y if x % y == 0 else gcd(y, x % y)
def lcm(x, y) : return (x * y) // gcd(x, y)
def I() : return int(input())
def MI() : return map(int, input().split())
def LI() : return [int(x) for x in input().split()]
def RI(N) : return [int(input()) for _ in range(N)]
def LRI(N) : return [[int(x) for x in input().split()] for _ in range(N)]
def chkprint(*args) : names = {id(v):k for k,v in currentframe().f_back.f_locals.items()}; print(', '.join(names.get(id(arg),'???')+' = '+repr(arg) for arg in args))

N = I()
A = LI()

As = [[i + 1, a] for i, a in enumerate(A)]
As.sort(key=lambda x : x[1])

for a in As:
    print(a[0], end=" ")

print()

Solution (Python):

n = int(input())
an = list(map(int, input().split()))

order = sorted(range(1, n+1), key=lambda x: an[x-1])
print(' '.join(map(str, order)))

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
s = sorted([[A[i], i+1] for i in range(N)])
ans = [s[i][1] for i in range(N)]
print(' '.join(map(str, ans)))

Solution (Python):
N = int(input())
A = list(map(int, input().split()))

array = sorted([(A[i], i+1) for i in range(N)])

print(" ".join([str(a[1]) for a in array]))

Solution (Python):
n = int(input())
A = list(map(int,input().split()))
C = [0 for i in range(n)]
for i in range(n):
    C[A[i]-1] = i+1
print(*C)

Solution (Python):
n=int(input())
box=list(map(int,input().split()))
for i,j in enumerate(box):
    box[i]=(j,i+1)
ans=[]
for i,j in sorted(box):
    ans.append(j)
print(*ans)

Solution (Python):
N = int(input())
A = list(map(int, input().split()))

TaskList = []

for i, a in enumerate(A):
    TaskList.append([a, i+1])

TaskList.sort()

for pair in TaskList:
    print(pair[1])

Solution (Python):
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

n = ni()
a = nl()

sl = sorted(range(len(a)), key=lambda k: a[k])

for s in sl:
    print(s+1)

Solution (Python):
N = int(input())
a = list(map(int, input().split()))

r = [""] * N

for i in range(N):
    index = a[i]-1
    r[index] = str(i+1)

print(" ".join(r))

Solution (Python):
N = int(input())
lst = []
A = list(map(int, input().split()))
for i in range(N):
	lst.append([A[i], i])

lst = sorted(lst, key = lambda x : (x[0], x[1]))
for i in range(N):
	print(lst[i][1] + 1, end=" ")

Solution (Python):
N = int(input())
A = list(map(int, input().split()))

lst = []

for i, a in enumerate(A):
    lst.append((a, i+1))

lst.sort()

llst = []
for val in lst:
    llst.append(str(val[1]))

print(" ".join(llst))

Solution (Python):
N = int(input())
A = [int(a) for a in input().split()]

for i in range(N):
    A[i] = [A[i], i+1]
    
A.sort()
ans = []
for i in range(N):
    ans.append(str(A[i][1]))
    
print(' '.join(ans))

Solution (Python):
def main():
    N = int(input())
    
    A = [int(a) for a in input().split()]

    AA = sorted(enumerate(A), key=lambda a: a[1])

    print(" ".join([str(i+1) for i, a in AA]))


if __name__ == "__main__":
    main()

Solution (Python):
N = int(input())
As  = list(map(int, input().split()))

sts = [(a,i+1) for i,a in enumerate(As)]
sts = sorted(sts)
ans = []
for st in sts:
    ans.append(st[1])
print(*ans)

Solution (Python):

import sys


def solve(N: int, A: "List[int]"):
    info = [[k+1, a] for k, a in enumerate(A)]
    info = sorted(info, key = lambda x: x[1])
    print(' '.join([str(i[0]) for i in  info]))
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    A = [int(next(tokens)) for _ in range(N)]  
    solve(N, A)

if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
a = [[i+1,x] for i,x in enumerate(map(int, input().split()))]
a.sort(key=lambda x:x[1])
print(*list(zip(*a))[0])

Solution (Python):
import numpy as np


def InputToInt():
    A = input().split()
    for i in range(len(A)):
        A[i] = int(A[i])
    return A
    
if __name__ == '__main__':
    N = int(input())
    A = InputToInt()

    B = np.argsort(A)+1
    for i in B:
        print(i, end=' ')
    print('')

Solution (Python):
def main(sample_file = ''):

    """ convenient functions
    
    
    
    
    
    """

    """convenient decorator
    
    
        
        
        
        
        
        
        
        
        
        
    """
    
    
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product 
    
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  
        b, e = 2, 0  
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        if r == 0: return 1
        if r == 1: return n
        numerator = [n - r + k + 1 for k in range(r)]
        denominator = [k + 1 for k in range(r)]
        for p in range(2,r+1):
            pivot = denominator[p - 1]
            if pivot > 1:
                offset = (n - r) % p
                for k in range(p-1,r,p):
                    numerator[k - offset] /= pivot
                    denominator[k] /= pivot
        result = 1
        for k in range(r):
            if numerator[k] > 1:
                result *= int(numerator[k])
        return result
    def combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict 
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest 
    from copy import deepcopy, copy 
    import operator
    from operator import itemgetter 
    
    
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd 
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    
    
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    modpow = lambda a, n, p = MOD: pow(a, n, p) 
    def modinv(a, p = MOD):
        
        
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        
        
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    
    
    
    
    

    def BellmanFord(N, M, ABC, vertex_start, vertex_end, value_if_inf = -1, find_shortest = False):
        """to calculate furthest or shortest length between vertex_start and vertex_end using BellmanFord algorithm
        
        Args:
            N (int): number of vertices
            M (int): number of edges
            ABC (list): [(ai, bi, ci) for _ in range(N)] where i-th edge is directed from vertex ai to vertex bi and the length is ci 
            vertex_start (int): start vertex. usually use 0.
            vertex_end (int): end vertex. usually use N-1.
            value_if_inf (int or string as you like, optional): value you want when the furthest (or shortest) distance is infinite (or -infinite). Defaults to -1.
            find_shortest (bool, optional): choose False to find furthest path. Defaults to False.
        
        Returns:
            int or string: normally int (but can be str if you set value_if_inf to str)
            
        Example:
                N, M, P = R()
                ABC = [R() for _ in range(M)]
                ABC = [(a-1, b-1, c-P) for a, b, c in ABC]
                print(BellmanFord(N, M, ABC, 0, N-1, value_if_inf = 'inf'))

        """

        def make_reachable_list(N, M, ABC, vertex_start, vertex_end):
            reachable_to_direct = defaultdict(list)
            reachable_from_direct = defaultdict(list)
            reachable_from_start = [False] * N
            reachable_to_end = [False] * N
            reachable_from_start[vertex_start] = True
            reachable_to_end[vertex_end] = True
            reachable_from_both_sides = [False] * N
            dfs_from_start = []
            dfs_to_end = []
            for a, b, c in ABC:
                reachable_to_direct[a].append(b)
                reachable_from_direct[b].append(a)
                if a == vertex_start:
                    dfs_from_start.append(b)
                    reachable_from_start[b] = True
                if b == vertex_end:
                    dfs_to_end.append(a)
                    reachable_to_end[a] = True
            while dfs_from_start:
                v = dfs_from_start.pop()
                for i in reachable_to_direct[v]:
                    if not reachable_from_start[i]:
                        reachable_from_start[i] = True
                        dfs_from_start.append(i)
            while dfs_to_end:
                v = dfs_to_end.pop()
                for i in reachable_from_direct[v]:
                    if not reachable_to_end[i]:
                        reachable_to_end[i] = True
                        dfs_to_end.append(i)
            for i in range(N):
                reachable_from_both_sides[i] = reachable_from_start[i] and reachable_to_end[i]
            return reachable_from_both_sides
        
        reachable_from_both_sides = make_reachable_list(N, M, ABC, vertex_start, vertex_end)
        
        if find_shortest:
            dist = [INF for i in range(N)]
        else:
            dist = [-INF for i in range(N)]
        
        dist[vertex_start] = 0
        for i in range(N):
            updated = False
            for a, b, c in ABC:
                if not reachable_from_both_sides[a]:
                    continue
                elif find_shortest:
                    update_condition = dist[a] + c < dist[b]
                else:
                    update_condition = dist[a] + c > dist[b]
                if dist[a] != INF and update_condition:
                    dist[b] = dist[a] + c
                    updated = True
                    if i == N-1:
                        return value_if_inf
            if not updated:
                break
        return dist[vertex_end]

    """ initialize variables and set inputs
    
        
        
    
        
        
        
        
        
        
        
    
        
        
        
        
    
        
        
    """

    
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    R = lambda: list(map(int, r().split()))
    Rmap = lambda: map(int, r().split())
    Rfloat = lambda: list(map(float, r().split()))
    Rtuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    
    
    
    
    
    
    
    """

    
    if sample_file:
        sys.stdin = open(sample_file)
        
    
    

    N = r_int()
    A = R()
    
    L = [0] * N
    for i, a in enumerate(A):
        L[a-1] = i + 1
    print(*L)
    

    
    
    

    """memo: how to use defaultdict of list
    
    Dic = defaultdict(list)
    
    Dic[x].append(y)
    
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    
    >>> a = 5
    >>> bin_str_a = format(a, '
    >>> print(bin_str_a)
    0b0101 
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

Solution (Python):
''' بِسْمِ اللَّهِ الرَّحْمَٰنِ الرَّحِيمِ '''

gi = lambda : list(map(int,input().split()))
n, = gi()
l = gi()
l = [(l[k], k + 1) for k in range(n)]
l.sort()
ans = [e[1] for e in l]
print(" ".join(map(str, ans)))

Solution (Python):
import sys
input = sys.stdin.readline
n = int(input())
s = list(map(int,input().split()))
t = []
for i in range(n):
    t.append([s[i],i])

t.sort()
k = []
for i in range(n):
    k.append(str(t[i][1]+1))

q = " ".join(k)
print(q)

Solution (Python):
N = int(input())
A = [int(_) for _ in input().split()]

ans_lis = [0] * N
for n in range(N):
    ans_lis[A[n] - 1] = n + 1
print(*ans_lis)

Solution (Python):
from sys import stdin

N = int(stdin.readline().rstrip())
A = [int(x) for x in stdin.readline().rstrip().split()]
ans = [0] * N

for i in range(N):
    ans[A[i] - 1] = i + 1

print(*ans)

Solution (Python):
N = int(input())
A = [int(x) - 1 for x in input().split()]
P = ["" for _ in range(N)]
for i, a in enumerate(A):
  P[a] = str(i + 1)
print(' '.join(P))

Solution (Python):
n = int(input())
l = list(map(int,input().split()))
for i in range(n):
  l[i] = [l[i],i+1]
l.sort()
for i in range(n):
  print(l[i][1],end = " ")

Solution (Python):
import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)

def s(generator, splitter, mapper):
    return [ mapper(s) for s in generator().split(splitter) ]


def get_nums_l():
    return [ int(s) for s in input().split(" ")]


def get_nums_n(n):
    return [ int(input()) for _ in range(n)]

n = int(input())
aaa = list(enumerate(get_nums_l()))

aaa.sort(key=lambda a:a[1])

aaa = map(lambda a: a[0]+1, aaa)
print(" ".join(map(str,aaa)))

Solution (Python):
n = int(input())
l = list(map(int, input().split()))

m = sorted(range(len(l)), key=lambda k: l[k])


for i in range(len(m)):
  print(m[i]+1)

Solution (Python):
N=int(input())
T=[int(x) for x in input().split()]
A=[[0]*2 for a in range(N)]
for i in range(N):
	A[i][0]=T[i]
	A[i][1]=i+1
A.sort()


t=0
for i in zip(*A):
	if t==0:
		t+=1
		continue
	print(*i)

Solution (Python):
n = int(input())
student = [ int(v) for v in input().split() ]
present = [ None for i in range(n) ]
for i, v in enumerate(student):
    present[v-1] = i + 1 
print(*present)

Solution (Python):
n=int(input())
k=[0 for i in range(n)]
a=[int(i) for i in input().split()]
for i in range(n):
    k[a[i]-1]=str(i+1)
print(" ".join(k))

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 6)

def main():
    n=int(input())
    aa=list(map(int, input().split()))
    stu=[]
    for i,a in enumerate(aa):
        stu.append([a,i])
    stu.sort()
    for a,i in stu:
        print(i+1)

main()

Solution (Python):
n = int(input())
A_list = [int(elm) for elm in input().split(" ")]

b = sorted( enumerate(A_list) , key = lambda x: x[1])
c = [str(bb[0] + 1) for bb in b]
out = " ".join(c)
print(out)

Solution (Python):
N = int(input())
A = list(map(int,input().split()))
X = [(A[i], i + 1) for i in range(N)]
X.sort()
ans = [ str(X[i][1]) for i in range(N)]
print(" ".join(ans))

Solution (Python):
import numpy as np

N = int(input())
A = np.array(list(map(int, input().split())))
B = np.argsort(A)
for b in B:
    print(b+1, end=' ')
print()

Solution (Python):
N = int(input())
A = [(i+1, int(a)) for i,a in enumerate(input().split())]
l = [i for i,a in sorted(A, key=lambda x: x[1])]
print(*l)

Solution (Python):
N = int(input())

A = list(map(int, input().split()))

order = [0] * N
for i in range(N):
    order[A[i]-1] = i+1


print(*order)

Solution (Python):
N = int(input())
A_list = list(map(int, input().split(' ')))

turn_list = [-1 for i in range(N)]

for i, A in enumerate(A_list):
    turn_list[A - 1] = i + 1
print(*turn_list)

Solution (Python):
N=int(input())
L=[0 for i in range(N+1)]

A=list(map(int,input().split()))
for i in range(N):
    L[A[i]]=i+1
print(*L[1:])

Solution (Python):
import sys
input = sys.stdin.readline
def inpl(): return list(map(int, input().split()))

N = int(input())
X = sorted([(x, i+1) for i, x in enumerate(inpl())], key=lambda x: x[0])
print(*[x[1] for x in X])

Solution (Python):
n = int(input())
A = zip(map(int, input().split()), range(1, n + 1))
print(*[a[1] for a in sorted(A)])

Solution (Python):
N,*A=map(int,open(0).read().split());print(*[i for i,j in sorted(enumerate(A,1),key=lambda x:x[1])])

Solution (Python):
N =int(input())
A =[int(i)for i in input().split()]
ans =["" for _ in range(N)]
for i,j in enumerate(A):
    ans[j-1] =str(i+1)
print(" ".join(ans))

Solution (Python):
n=int(input())
alist = list(map(int, input().split()))

blist=[0]*n

for i in range(n):
    blist[alist[i]-1]=i+1


for bl in blist:
    print(bl, end=" ")

Solution (Python):
n=int(input())
a=list(map(int,input().split()))

ans=[0]*n

for i in range(n):
  ans[a[i]-1]=i+1

print(*ans)

Solution (Python):
N = int(input())
A = list(map(int,input().split()))

B = [0]*N
for j in range(N):
    B[A[j]-1] = j+1
for a in B:
    print(a,end=" ")

Solution (Python):
N = int(input())
A = [int(x) for x in input().split()]
O = [0] * N
for i, a in enumerate(A):
  O[a - 1] = i + 1
print(*O)

Solution (Python):
N = int(input())
A = list(map(int,input().split()))
dic = {}
for i,a in enumerate(A):
    dic[a] = i+1
for i in range(1,N+1):
    print(dic[i],end=' ')

Solution (Python):
n = int(input())
a = [(i + 1, int(x)) for i, x in enumerate(input().split())]

a.sort(key=lambda x: x[1])
print(*list(map(lambda x: x[0], a)))

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

N = int(input())
A = list(map(int, input().split()))
B = [[A[i], i+1] for i in range(N)]

B = sorted(B)

for i in range(N):
    print(B[i][1], end= " ")

Solution (Python):
n = int(input())
dat_a = list(map(int, input().split()))
dat = []
for i in range(n):
    dat.append((i+1, dat_a[i]))


dat.sort(key=lambda x: x[1])

res = []
for i in range(n):
    res.append(str(dat[i][0]))
print(" ".join(res))

Solution (Python):
N = int(input())
I = [0] * N
A = list(map(int, input().split()))
for i, a in enumerate(A):
    I[a-1] = i+1
print(*I)

Solution (Python):
n = int(input())
alist = list(enumerate([int(v) for v in input().split()], start=1))
alist = sorted(alist, key=lambda v: v[1])
print(' '.join([str(n) for n, _ in alist]))

Solution (Python):



def ri():
    return int(input())

def rl():
    return list(input().split())

def rli():
    return list(map(int, input().split()))

def main():
    n = ri()
    la = rli()
    lb = []
    for i, a in enumerate(la):
        lb.append((a, i))
    lb.sort()
    print(" ".join(map(str, [e[1]+1 for e in lb])))


if __name__ == '__main__':
    main()

Solution (Python):
n=int(input())
a=[int(i) for i in input().split()]
b=[0]*(n)
for i in range(0,len(a)):
    b[a[i]-1]=(i+1)
print(*b)

Solution (Python):
N = int(input())
As = list(map(int, input().split()))
Is = sorted(range(N), key=lambda i: As[i])
print(" ".join([str(i+1) for i in Is]))

Solution (Python):
N = int(input())
A = [-1]*N
M = list(map(int,input().split()))
for i in range(N):
    A[M[i]-1]=i+1

print(*A)

Solution (Python):
def getlist():
	return list(map(int, input().split()))

N = int(input())
A = getlist()

L = []
for i in range(N):
	L.append([A[i], i + 1])
L = sorted(L)
ans = []
for i in range(N):
	ans.append(str(L[i][1]))

print(" ".join(ans))

Solution (Python):
N = int(input())

a_list = list(map(int, input().strip().split()))

order = [0] * N

for i, a in enumerate(a_list):
	order[a - 1] = str(i + 1)

print(" ".join(order))

Solution (Python):
n=int(input())
a=list(map(int, input().split()))

b=[]
for i,name in enumerate(a):
    b.append([i+1, name])
b.sort(key=lambda x: x[1])
for i in b:
    print(i[0])

Solution (Python):
import math, string, itertools, fractions, heapq, collections, re,  array, bisect, sys, random, time, copy, functools, os, pdb
sys.setrecursionlimit(10**7)
from queue import PriorityQueue
inf = 10 ** 20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def _I(): return int(sys.stdin.readline())
def _F(): return float(sys.stdin.readline())
def _pf(s): return print(s, flush=True)
def perr(s): return print(s, file=sys.stderr)
"""
"""
N = _I()
A = LI()

A = [[i, idx+1] for idx, i in enumerate(A)]

A.sort(key=lambda x: x[0])
A = [str(i[1]) for i in A]
print(' '.join(A))

Solution (Python):

import sys
input = sys.stdin.readline
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7



N = int(input())
A = list(map(int, input().split()))

a = []
for i in range(N):
    a.append( (A[i], i+1) )

a.sort()
for (x, y) in a:
    print(str(y)+" ", end="")

print("")

Solution (Python):











import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,log 
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    N = I()
    A = LI()
    B=[]
    for i,a in enumerate(A):
        B.append((a,i+1))
    B.sort()
    for b in B:
        print(b[1],end=" ")
    print()
if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
a = list(map(int, input().split( )))

A = [[a[i],i] for i in range(n)]

A.sort()

for i in range(n):
    print(A[i][1]+1,end=" ")

Solution (Python):
N=int(input())
A=list(map(int,input().split()))

B=[[A[i],i+1] for i in range(N)]
B.sort()


print(*[b[1] for b in B])

Solution (Python):

N = int(input())
A = list(map(int,input().split()))

B = list(enumerate(A))
B.sort(key = lambda x:x[1])
ans = []
for i in range(N):
    ans.append(B[i][0]+1)
print(*ans)

Solution (Python):
N = int(input())
A = sorted((a,i) for i,a in enumerate(map(int,input().split())))
print(*(i+1 for a,i in A))

Solution (Python):










import sys
import os
from io import IOBase, BytesIO


def main():
    n = int(input())
    tmp = get_array()
    arr = []
    for i in range(n):
        arr.append([tmp[i], i + 1])
    arr.sort()
    for i in range(n):
        print(arr[i][1], end=" ")


BUFSIZE = 8192


class FastIO(BytesIO):
    newlines = 0

    def __init__(self, file):
        self._file = file
        self._fd = file.fileno()
        self.writable = "x" in file.mode or "w" in file.mode
        self.write = super(FastIO, self).write if self.writable else None

    def _fill(self):
        s = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
        self.seek((self.tell(), self.seek(0, 2), super(FastIO, self).write(s))[0])
        return s

    def read(self):
        while self._fill():
            pass
        return super(FastIO, self).read()

    def readline(self):
        while self.newlines == 0:
            s = self._fill()
            self.newlines = s.count(b"\n") + (not s)
        self.newlines -= 1
        return super(FastIO, self).readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.getvalue())
            self.truncate(0), self.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        py2 = round(0.5)
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        if py2 == 1:
            self.write = self.buffer.write
            self.read = self.buffer.read
            self.readline = self.buffer.readline
        else:
            self.write = lambda s: self.buffer.write(s.encode("ascii"))
            self.read = lambda: self.buffer.read().decode("ascii")
            self.readline = lambda: self.buffer.readline().decode("ascii")


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)


def get_array():
    return list(map(int, sys.stdin.readline().split()))


def get_ints():
    return map(int, sys.stdin.readline().split())


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


if __name__ == "__main__":
    main()

Solution (Python):
import numpy as np
def main():
    out=0
    N=int(input())
    A=list(map(int,input().split()))
    A=np.array(A)
    return " ".join([str(x+1) for x in np.argsort(A).tolist()])

print(main())