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



Sample input:
3
2 3 1


Sample output:
3 1 2

Submission status: Runtime Error

Solution code:
print(" ".join(map(lambda x: str(x[1]), sorted([(int(a), num) for a, num in zip(input().split(" "), list(range(1,int(input()) + 1)))]))))

Submission status: Runtime Error

Solution code:
N=int(input())
A=list(map(int,input().split()))
box=[]

for i in range(N):
  box.insert(i,A.index(i+1)+1)
print(' '.join(box))

Submission status: Runtime Error

Solution code:
N=int(input())
A=list(map(int,input().split()))
box=[]

for i in range(N):
  box.insert(i,A.index(i+1)+1)
print(join(box))

Submission status: Runtime Error

Solution code:
n = int(input())
A = list(map(int, input().split()))
import numpy as np
A = np.array(A)
for i in range(N):
    b = np.where(A==i+1)
    print(b[0][0]+1)

Submission status: Runtime Error

Solution code:
n = int(input())
A = map(int, input().split())
import numpy as np
A = np.array(A)
B = []
for i in range(n):
    b = np.where(A==i+1)
    print(b[0][0]+1)

Submission status: Runtime Error

Solution code:
n = input()
A = map(int, input().split())
import numpy as np
A = np.array(A)
B = []
for i in range(N):
    b = np.where(A==i+1)
    print(b[0][0]+1)

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int,input().split()))
b = []

for i in range(n):
  for j in range(n):
    if a[j] == i + 1:
      b.append(i+1)
      break

print(' '.join(b))

Submission status: Runtime Error

Solution code:
#sort
N = int(input())
A = list(map(int, input().split()))
attend_list = []
 
for i in range(N):
  attend_list[int(A[i]-1)] = int(i+1) 
 
print(attend_list)

Submission status: Runtime Error

Solution code:
#sort
N = int(input())
A = list(map(int, input().split()))
attend_list = []

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

print(attend_list)

Submission status: Runtime Error

Solution code:
N=int(input())
A={}
for i in range(1,N+1):
    A[i]=int(input())
A=sorted(A.items(),key=lambda x:x[1])
for k in A:
    print(k[0],end=" ")

Submission status: Runtime Error

Solution code:
n = int(input())
a = map(int,input().split())
f = {}
count = 0
for i in a:
  count=+1
  f[count] = i
inv_map = {v: k for k, v in f.items()}
print inv_map[i] for i in range(n)

Submission status: Runtime Error

Solution code:
import numpy as np

n = int(input())
a = input().split()
s = ''

s = np.argsort(a)

for i in range(n):
	s[i] += 1 
s.strip("[")
s.strip("]")


print(s)

Submission status: Runtime Error

Solution code:
n = int(input())
a = input().split()
s = ''
iList = [[ 0 for i in range(n)] for i in range(n)]


MIN = 100
#iの時にa[i]人いた
#a[i]が小さい順に並べてその時のiを順番に出力
for i in range(n):
	a[i] = int(a[i])
	iList[i][0] = a[i]
	iList[i][1] = i+1

for i in range(n):
	for j in range(n):
		if iList[i][0] < iList[j][0]:
			t = iList[i]
			iList[i] = iList[j]
			iList[j] = t

s += str(iList[0][1])
for i in range(1,n):
	s += ' '
	s += str(iList[i][1])
	


print(s)

Submission status: Runtime Error

Solution code:
n = int(input())
a = input().split()
s = ''
iList = [[ 0 for i in range(n)] for i in range(n)]


MIN = 100
#iの時にa[i]人いた
#a[i]が小さい順に並べてその時のiを順番に出力
for i in range(n):
	a[i] = int(a[i])
	iList[i][0] = a[i]
	iList[i][1] = i+1
for i in range(n):
	for j in range(n):
		if iList[i][0] < iList[j][0]:
			t = iList[i]
			iList[i] = iList[j]
			iList[j] = t
for i in range(n):
	s += str(iList[i][1])
	s += ' '


print(s)

Submission status: Runtime Error

Solution code:
N, K = input().strip().split()
N = int(N)
K = int(K)

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

count = 0
for i in range(N):
    if h[i] >= K:
        count += 1
print(count)

Submission status: Runtime Error

Solution code:
N = int(input())

lis = []

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

first = []*N

for i in range(N):
  num = lis[i]
  first[num] = i
  
for i in range(N):
  print(for _ in first)

Submission status: Runtime Error

Solution code:
N = int(input())

lis = []

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

first = []*N

for i in range(N):
  num = lis[i]
  first[num] = i
  
for i in range(N):
  print(first[i],end=' ')

Submission status: Runtime Error

Solution code:
N = int(input())

lis = []

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

first = []*N

for i in range(N):
  num = lis[i] - 1
  first[num] = i + 1
  
for i in range(N):
  print(first[i],end=' ')

Submission status: Runtime Error

Solution code:
N = int(input())

lis = []

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

first = []*N

for i in range(N):
  num = lis[i]
  first[num] = i + 1
  
for i in range(N):
  print(first[i],end=' ')

Submission status: Runtime Error

Solution code:
N = int(input())

lis = []

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

first = []

for i in range(N):
  num = lis[i]
  first[num] = i + 1
  
for i in range(N):
  print(first[i],end=' ')

Submission status: Runtime Error

Solution code:
N = int(input())

lis = []

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

first = []

for i in range(N):
  first[lis[i]] = i + 1
  
for i in range(N):
  print(first[i],end=' ')

Submission status: Runtime Error

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

B = [0 for _ in range(N)]
for i, a in enumerate(A):
    B[a - 1] = str(i + 1)

print(' '.join(B))

Submission status: Runtime Error

Solution code:
import numpy as np
N = int(input())
A = list(map(int,input().split()))
ans = np.argsort(A)+1
for a in ans:
    sys.stdout.write(str(a))
    sys.stdout.write(" ")

Submission status: Runtime Error

Solution code:
import numpy as np
N = int(input())
A = list(map(int,input().split()))
ans = np.argsort(A)+1
for a in ans:
    sys.stdout.write(str(a))
    sys.stdout.write(" ")

Submission status: Runtime Error

Solution code:
n = int(input())
_ = list(map(int, input()))
a = []
for i in range(1,n+1):
  a.append(_[i-1], i)
  
ans = []
a_sort = (sorted(a, key=lambda x: x[0]))
for i in range(n):
  ans.append(a_sort[i][1])
  
print(' '.join(list(map(str, ans))))

Submission status: Runtime Error

Solution code:
n = input()
a = [int(ocu) for ocu in input().rstrip().split()]

paired_a = zip(range(1, n+1), a)

paired_a.sort(lambda x:x[1])

print(" ".join([pair[0] for pair in paired_a]))

Submission status: Runtime Error

Solution code:
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define all(x) x.begin(),x.end()
#define dbg(x) cout<<#x<<":"<<x<<endl
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<ll,P> PP;

int main(){
  int n;
  cin>>n;
  vector<P> p(n);
  for(int i=0;i<n;i++){
    cin>>p[i].fi;
    p[i].se=i;
  }
  sort(all(p));
  for(int i=0;i<n;i++){
    if(i)cout<<" ";
    cout<<p[i].se+1;
  }
  cout<<endl;
}

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int, input().split()))
b = {}
for i in range(n):
  b.add((a[i], i+1))
for x,y in sorted(b):
  print(y, end=" ")

Submission status: Runtime Error

Solution code:
n = int(input())
a = input().split(" ")
order = ""
j = 1
for i in a:
  b = {j=>i}
print(b)
'''  
order.rstrip()
print(order)  
'''

Submission status: Runtime Error

Solution code:
n = int(input())
a = map(int,input().split(" "))
order = ""
for i in range(n):
  for j in a:
    if j == i+1:
      order += j + " "
print(order.rstrip)

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int,input().split()))
b = []
for i in range(n):
  b.append(a[i], i+1)
b.sort()
ans = []
for i in range(n):
  ans.append(b[i][1])
print(''.join(map(str, ans)))

Submission status: Runtime Error

Solution code:
n = int(input())
l = list(map(int, input().split()))
for i in range(n):
    print(l.find(i), end = " ")

Submission status: Runtime Error

Solution code:
N = int(input())
A = [int(x) for x in input().split()]
tmp = list()
for n in range(len(A)):
  tmp.append([n+1, A[n]])
tmp = sorted(tmp, key=lambda x: x[1])
res = ""
for x in tmp:
  res.append(x[0])
print(*res)

Submission status: Runtime Error

Solution code:
N = int(input())
A = [int(x) for x in input().split()]
tmp = list()
for n in range(len(A)):
  tmp.append([n+1, A[n]])
tmp = sorted(tmp, key=lambda x: x[1])
res = ""
for x in tmp:
  res.append(x[0])
print(' '.join(res))

Submission status: Runtime Error

Solution code:
N=int(input())
A=list(map(int,input().split()))
box=[]

for i in range(N):
    box.insert(A[i],i)
    print(box)

Submission status: Runtime Error

Solution code:
N=int(input())
A=list(map(int,input().split()))
box=[]

for i in range(N)
    box.insert(A[i],i)
    print(box)

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int,input().split()))
res = []
for i,e in enumerate(a):
    res.append((e,i))
res.sort()
ans = []
for i in res:
    ans.append(i[1]+1)
print(" ".join(ans))

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int, input().split()))
ans = [0] * n
for i in range(n):
    x[a[i]-1]=i+1
print(*x)

Submission status: Runtime Error

Solution code:
n = int(input())
a = list([int(x), int(y)+1] for x, y in zip(input()split(), range(n)))
a.sort()
for i in range(n):
    print(a[i], end=" ")

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int, input().split()))
a2 = sorted(a)
a3 = [ a2[i + 1] for i in a2 ]
print(a3)

Submission status: Runtime Error

Solution code:
N = int(input().split()[0])
aa = input().split()
bb = []

for i in range(1, N+1):
    bb.append(aa.index(str(i+1)))

print(*bb)

Submission status: Runtime Error

Solution code:
n=int(input())
a=list(map(int,input().split()))
b=[0 for _ in range(n)]
for i in range(n):
  b[a[i]-1] = i+1
print(''.join(b))

Submission status: Runtime Error

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

b = []
for i,e in enumerate(a):
  b.append(e,i+1)
  
sort(b)

for i,t in enumerate(b):
  if i == n-1:
    print(t[0])
  else:
    print(t[0],end=' ')

Submission status: Runtime Error

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

b = []
for i,e in enumerate(a):
  b.append(e,i+1)
  
sort(b)

print(' '.join(b))

Submission status: Runtime Error

Solution code:
n = int(input())
aaa = list(map(int, input().split()))
bbb = sorted(list(enumerate(aaa, start=1)), key=itemgetter(1))
print(*map(itemgetter(0), bbb))

Submission status: Runtime Error

Solution code:
import numpy as np

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

ans = np.zeros(N)

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

for i in range(N):
    print(int(ans[i]), end=' ')

Submission status: Runtime Error

Solution code:

import numpy as np

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

ans = np.zeros(N)

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

for i in range(N):
    print(int(ans[i]), sep=' ', end=' ')

Submission status: Runtime Error

Solution code:

Created on Sun Sep 29 22:57:46 2019

@author: hiros
"""
import numpy as np

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

ans = np.zeros(N)

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

for i in range(N):
    print(int(ans[i]), sep=' ', end=' ')

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std; 
typedef long long int ll;
#define pb push_back 
#define pop pop_back
#define mp make_pair
#define ve vector
#define vii vector < int >
#define vll vector < ll > 
#define pii pair < int , int >
#define pll pair < ll , ll >
#define fi first
#define sz size 
#define len length 
#define se second 
const ll p = 31;
const ll mod = 67280421310721;
const ll N=1000000+6;
#define M_PI           3.14159265358979323846

struct stu{
  ll num_b4, stu;
};
  
bool comp(stu a,stu b){
  return a.num_b4<b.num_b4;
}

int main()

{
ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
   #ifndef ONLINE_JUDGE
   freopen("input.txt", "r", stdin);
   freopen("output.txt", "w", stdout);
   freopen("error.txt", "w", stderr);
   #endif
   int n;cin>>n;
   stu a[n];
   int s;
   for(int i = 0;i<n;i++){
      cin>>s;
      a[i].num_b4 = s;
      a[i].stu = i;

   }
   sort(a,a+n,comp);
   for(int i = 0;i<n;i++){
    cout<<a[i].stu+1<<" ";
   }
   cout<<'\n';
}

Submission status: Runtime Error

Solution code:
n = int(input())
a = *map(int, input().split()),
for i in range(1, n+1):
    print(a.index(i)+1, end = ' ')

Submission status: Runtime Error

Solution code:
N = int(input())
S = list(map(int, input().split()))
indexed_S = sorted([i,s for i,s in enumerate(S)], key = lambda x: x[1])
print(" ".join([iS[0] for iS in indexed_S])

Submission status: Runtime Error

Solution code:
n = int(input())
h = tuple(map(int, input().split()))
ans = [0]*n
for i in range(1, n+1):
  ans[h[i]-1] = i+1
print(*ans)

Submission status: Runtime Error

Solution code:
n = int(input())
l = list(map(int, input().split(" ")))
a =[0]*num

for i in range(n):
    #print(i)
    a[l[i]-1] = i + 1 #each_numのi番目のインデックスに代入, -1 はi 番目が1,2,3 ...

for i in range(n):
    print(a[i], end = " ")

Submission status: Runtime Error

Solution code:
import numpy as np
 
N = int(input())
A= list(map(int, input().split()))
A=np.array(A)
S=np.array(range(N))
 
con=np.vstack([A,S])
 
con=con[:, con[0,:].argsort()]
ans=con[1,]+1
ans=str(ans)
print(ans)

Submission status: Runtime Error

Solution code:
n = int(input())
array = list(map(int, input().split()))
for i in range(n):
    map[array[i]] = str(i+1)
print(" ".join([map[i] for i in range(1, n+1)]))

Submission status: Runtime Error

Solution code:
n = map(int, input())
array = list(map(int, (input().split())))
map = {}
# make map to get table.
for i in range(n):
    map[array[i]] = i+1
# from 1 to n
list = []
for i in range(1, n+1):
    list.append(map[i])
print(list)

Submission status: Runtime Error

Solution code:
n = map(int, input())
array = list(map(int, input().split()))
map = {}
# make map to get table.
for i in range(n):
    map[array[i]] = i+1
# from 1 to n
list = []
for i in range(1, n+1):
    list.append(map[i])
print(list)

Submission status: Runtime Error

Solution code:
n = input()
array = map(int, input().split())
map = {}
# make map to get table.
for i in range(n):
    map[array[i]] = i+1
# from 1 to n
list = []
for i in range(1, n+1):
    list.append(map[i])
print(list)

Submission status: Runtime Error

Solution code:
N = int(input())
L = list(map(int, input().split()))

M = []

for i in range(len(L)):
    l = (L[i], i+1)
    M.append(l)

M = sorted(M)

for x in M:
    print(M[1])

Submission status: Runtime Error

Solution code:
n = int(input())
arr = list(map(int,input().split(' ')))
res = [0]*(n+1)
for i,v in enumerate(arr):
  res[v] = i+1
res.pop(0)
print(' '.join(res))

Submission status: Runtime Error

Solution code:
n=int(input())
A = list([int(x) for x in input().split()])
a=[]
for i in range(len(A)):
  a.[A[i-1]]=i+1
for i in a:
  print(a)

Submission status: Runtime Error

Solution code:
def main():
  n=int(input())
  l=list(map(int,input().split()))
  k=[0]*n
  for i in range(1,n+1):
    k[l[i]-1]=str(i)
  print(" ".join(k))


if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
def main():
  n=int(input())
  l=list(map(int,input().split()))
  k=[0]*n
  for i in range(1,n+1):
    k[i-1]=str(l.index(i)+1)
    print(" ".join(k))

main()

Submission status: Runtime Error

Solution code:
n=int(input())
l=list(map(int,input().split()))
print(" ".join(map(str,[l.index(i)+1 for i in range(1,n+1)]))

Submission status: Runtime Error

Solution code:
N = int(input())
A = list(map(int, input().split()))
List = [0]*N

for i in range(N):
  List.append(str(A.index(i+1)+1))



print(' '.join(List))

Submission status: Runtime Error

Solution code:
N = int(input())
A = list(map(int, input().split()))
junb = []
inde = 0
basyo = 0
for touko in A:
    basyo = A.index(inde) + 1
    junb.append(basyo)
    inde += 1
print(junb)

Submission status: Runtime Error

Solution code:
n=int(input())
a=list(map(int,input().split()))
for i in range(n):
  print(str(a.index(i+1),end=" ")

Submission status: Runtime Error

Solution code:
from numba.decorators import jit
@jit
def main():
  n = int(input())
  a = [i-1 for i in list(map(int,input().split()))]
  print(" ".join(map(str,[1 + a.index(i) for i in range(n)])))
main()

Submission status: Runtime Error

Solution code:
N = int(input())
A = list(map(int, input().split()))
List = []


for i, a in enumerate(A):
  List[int(a)-1] = str(i+1)

  
print(" ".join(List))

Submission status: Runtime Error

Solution code:
N = int(input())
A = list(map(int, input().split()))
List = [0]*N


for i, a in enumerate(A):
  ret[int(a)-1] = str(i+1)

  
print(" ".join(ret))

Submission status: Runtime Error

Solution code:
N = int(input())
A = list(map(int, input().split()))
List = [0]*N


for i, a in enumerate(A):
  ret[int(a-1)] = str(i+1)

  
print(" ".joint(ret))

Submission status: Runtime Error

Solution code:
import numpy as np

N = input()
a = list(int(i) for i in input().split())
an = np.array(a)
a_sort = np.argsort(an)
for i in a_sort:
  sys.stdout.write(i+" ")

Submission status: Runtime Error

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

b = a.reverse()
if a == n:
    print()
else:
    b[0],b[n] = b[n],b[0]
    print(a.reverse())
print(e)

Submission status: Runtime Error

Solution code:
import numpy as np
num = int(input())
each_num = list(map(int, input().split(" ")))

i = 1
ans = [[]]
while i >= num:
    ans.append = each_num.index(i)

print(ans)

Submission status: Runtime Error

Solution code:
import sys
N = int(input())
A = list(map(int,input().split()))
 
for i in range (1,N+1):
  print(A.index(i) + 1, end=" ")
  A.del(i)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
H = [int(h) for h in input().split()]

answer = []
for i in range(1,N+1,1):
    answer.append(H_i.index(i)+1)
print(' '.join(map(str,answer)))

Submission status: Runtime Error

Solution code:
N = int(input())
A = [int(i) for i in input().split()]
B=[]*N
for i in range(N):
  B[A[i]]=i+1

ans=''
for i in range(N-1):
  ans = ans + str(B[i])+' '
ans = ans + str(B[N-1])
print(ans)

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int, input().split()))
k=[]
for i in range(1, n + 1):
  k.append(a.index[i] + 1)
print(k[l] for l in range(n). end =' ')

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int, input().split()))
k=[]
for i in range(1, n + 1):
  k.append(a.index(i) + 1)
print(k[l] for l in range(n). end =' ')

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int, input().split()))
k=[]
for i in range(1, n + 1):
  k.insert(0, a.index(i) + 1)
print(k[l] for l in range(n). end =' ')

Submission status: Runtime Error

Solution code:
n= int(input())
a_list=list(int,input().split())
for i in range(n):
  print (a_list.index(i+1)+1 ,end=' ')

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int, input().split()))
k=[]
for i in range(1, n + 1):
  k.insert(0, a.index(i) + 1)
print(k[l] for i in range(n). end =' ')

Submission status: Runtime Error

Solution code:
$ cat atcorder_142_C.py
N = int(input())
s = raw_input().split()
h = [0]*N

for i in range(N):
    h[i] = int(s[i])
    h[i] = (h[i], i+1)

#print h
h.sort()
#print h

for i in range(N-1):
    print h[i][1],

print h[N-1][1]

Submission status: Runtime Error

Solution code:
a, b = map(int, input().split())
# a <= b
if a > b:
    a, b = b, a
cd = [i for i in range(1, a+1) if a % i == 0 and b % i == 0]
if len(cd) <= 2:
    ans = len(cd)
else:
    #公約数1はあとで追加するよ
    li = [cd[1]]
    for i in cd:
        for j in li:
            if i % j == 0:
                break
        else:
            li.append(i)
    ans = len(li)+1
print(ans)

Submission status: Runtime Error

Solution code:
n=int(input())
a=list(map(int,input().split()))
A={}
for i in range(n):
  A.append(a.index(i+1))
for i in range(n):
  print(A[i] )

Submission status: Runtime Error

Solution code:
n = input()
n = input()
n = int(n)
N = list(map(int,input().split()))
C = []
for i in range(n):
    C.append(i+1)

ch = []
a = 1
for j in range(n):
    for k in range(0,n):
        if N[k] == a:
            ch.append(C[k])
            a +=1
ans = ' '.join(ch)
print(ans)

Submission status: Runtime Error

Solution code:
import numpy as np
N = int(input())
A = list(map(int, input().split()))
A = np.array(A)
B = np.array([1]*N)
indices = [*range(len(A))]
sorted_indices = sorted(indices, key=lambda i: A[i])
#for i in range(1, N+1):
#    B.append(A.index(i)+1)
#print(B)
sorted_indices = sorted_indices + B

print(*sorted_indices)

Submission status: Runtime Error

Solution code:
from math import gcd, sqrt


def is_prime(n):
    flag = True
    for k in range(2, int(sqrt(n)) + 1):
        if n % k == 0:
            flag = False
            return

    if flag:
        return n


def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    divisors.sort()
    return divisors


def main():
    a, b = map(int, input().split())
    coms = make_divisors(gcd(a, b))
    # print(coms)
    ans = [is_prime(i) for i in coms]
    # print(ans)
    ans2 = [a for a in ans if a is not None]
    print(len(ans2))


if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
for i in range(1, N+1):
    ans.append(A.index(i)+1)
print(' '.join(map(str, ans)))

Submission status: Runtime Error

Solution code:
result = 0
N = list(map(int, input().split())) 
A = list(map(int, input().split())) 
for i in range(N[0]):
    p1 = A[i]
    if p1 >= N[1]:
        result +=1
print(result)

Submission status: Runtime Error

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

for i in range(N):
    order_list.append(A.index(i+1))

for x in order_list:
    print(str(x+1) + ' ', end='

Submission status: Runtime Error

Solution code:
n = input()
N = list(map(int,input().split()))
C = []
for i in range(n):
    C.append(i+1)

dic = {}
ch = []
for j in range(n):
    dic.setdefault(N[j],C[j])
for k in range(1,n+1):
    for m in dic.iterkeys():
        if k == m:
            value = dic[m]
            ch.append(value)

ans = ' '.join(ch)
print(ans)

Submission status: Runtime Error

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

b = a.reverse()
c = b.pop(0)
e = c.apped(0)
print(e)

Submission status: Runtime Error

Solution code:
n = input()
N = list(map(int,input().split()))
C = []
for i in range(n):
    C.append(i+1)

dic = {}
ch = []
for j in range(n):
    dic.setdefault(N[j],C[j])
for k in range(1,n+1):
    for m in dic.iterkeys():
        if k == m:
            value = dic[m]
            ch.append(value)
            print (value)

Submission status: Runtime Error

Solution code:
N=input()
a=list(map(int, input()))
b=a
c=1
if c<=N:
	d=a[c-1]
	b[d-1]='c'
	c+=1
''.join(b)

Submission status: Runtime Error

Solution code:
import numpy as np
N = int(input())
A = list(map(int, input().split())) 

for i in range(N):
    result = A.index(i+1) + 1
	print(result)

Submission status: Runtime Error

Solution code:
j = 0
a = 0
i = 0
mylist = []
for i in range(N):
    mylist.insert(i, 0)
N=int(input())
h = [int(x) for x in input().split()]
   
for i in range(N):
    mylist[h[i]-1]=i+1
    
print(*mylist)

Submission status: Runtime Error

Solution code:
N = int(input())
A = [int(i) for i in input().split()]

import pandas as pd
a = pd.DataFrame({'a': A})
a.index = range(1, N + 1)
b = a.sort_values('a')
l = b.index.tolist()
print(*l)

Submission status: Runtime Error

Solution code:
import pandas as pd
N = input()
cum_numbers = input()

series_cum_numbers = pd.Series(list(map(int, cum_numbers.split(" "))))

student_order = series_cum_numbers.sort_values().index + 1

print(" ".join(map(str, list(student_order))))

Submission status: Runtime Error

Solution code:
n=int(input())
A=list(map(int,input().split()))
a=[]
for i in range(n):
  a.append([i+1])
for j in range(n):
  a[j].append(A[j])
a.sort(key=lambda x:x[1])
lst=[]
for k in range(n):
  lst.append(a[k][0])
print(''.join(lst))

Submission status: Runtime Error

Solution code:
mport numpy as np

N = int(input())
Stu = list(input().split())
Stu2 = [int(i) for i in Stu]
print(Stu2)

x = np.argsort(Stu2)
print(x)
for i in range(N):
    Stu[i] = x[i] + 1

print(' '.join(map(str, Stu)))

Submission status: Runtime Error

Solution code:
import sys
input = sys.stdin().readline()

N = int(input())
A = list(map(int, input().split()))
for i in range(N):
    print(A.index(i+1) +1, end =' ')

Submission status: Runtime Error

Solution code:
N=input()
a=list(map(int, input()))
b=a
c=1
if c<=N:
	d=a[c-1]
    b[d-1]=c
    c+=1
' '.join(b)

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int, input().split()))
ans = [0] * n
for i in range(n):
       ans[a[i]-1] = i+1
for j in range(len(ans):
       print(ans[j] , end = " ")

Submission status: Runtime Error

Solution code:
N =int(input())
dic = {}
j=1
for i in map(int, input().split()):
    dic[i]=j
    j+=1
for n in range(N):
    print(dic[n])

Submission status: Runtime Error

Solution code:
N=input()
a=list(map(int, input().split()))
b=a
c=1
if c<=N:
	d=a[c-1]
    b[d-1]=c
    c+=1
' '.join(b)

Submission status: Runtime Error

Solution code:
n = int(input())a = list(map(int, input().split(" ")))i = 0list = []for a_s in a:list.insert(0, (a.index(n - i) + 1))i += 1print(*list)

Submission status: Runtime Error

Solution code:
N=int(input())
A=list(map(int,input().split()))
B=A.sort()
x=1
for i in range (N):
  if  A[B[i]-1]==i+1:
    print (x)
  else:
    x= x+1

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int, input().split()))
ans = [0 for in range(n)]
for i in range(n):
       ans[a[i]-1] = i+1
for j in range(len(ans):
       print(ans[j] , end = " ")

Submission status: Runtime Error

Solution code:
import numpy as np
N = (int(i) for i in input().split())
b = [int(i) for i in input().split()]]
i=np.argsort(b)
print(i+1)

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int, input().split()))
ans = [0 for in range(n)]
for i in range(n):
       ans[a[i]-1] = i+1
for j in range(len(ans):
       print(ans[i] , end = " ")

Submission status: Runtime Error

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

print([str(A.index(x)+1) for x in range(1,N+1)])
print(" ".join(aa))

Submission status: Runtime Error

Solution code:
N=input()
stu=list(map(int,input().split()))
stu2=list(range(8))
for i in range(N):
  for j in range(N):
    if stu[i]==j:
      stu2[j-1]=i+1
print(stu2)

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int, input().split()))
ans = [0 for in range(n)
for i in range(n):
       ans[a[i]-1] = i+1
for j in range(len(ans):
       print(ans[i] , end = " ")

Submission status: Runtime Error

Solution code:
N = int(input())
arr = np.array([[int(num), int(i)+1] for i, num in enumerate(input().split())])
print(str(arr[np.argsort(arr[:,0])][:, 1])[1:-1])

Submission status: Runtime Error

Solution code:
n = int(input())a = list(map(int, input().split(" ")))i = 0list = []for a_s in a:list.insert(0, x = a.index(n - i) + 1)i += 1print(*list)

Submission status: Runtime Error

Solution code:
N=input()
a=list(map(int, input().split()))
b=a
c=1
if c<=N:
	d=a[c]
    b[d]=c
    c+=1
' '.join(b)

Submission status: Runtime Error

Solution code:
N=input()
a=list(map(int, input().split()))
b=a
c=1
if c<=N:
	d=a[c]
    b[d]=c
    c+=1
''.join(b)

Submission status: Runtime Error

Solution code:
N = int(input())
A = list(map(int,input().split()))
for i in range(N):
    print(A.index(i+1)+1, end=" ")

Submission status: Runtime Error

Solution code:
N=input()
a=list(map(int, input().split()))
b=a
c=1
if c<=N:
	d=a[c]
    b[d]=c
    c+=1
print(b)

Submission status: Runtime Error

Solution code:
import sys
input = sys.stdin.readline()

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

for i in range(N):
    print(A.index(i+1) +1, end =' ')

Submission status: Runtime Error

Solution code:
N=input()
a=list(map(int, input().split()))
b=a
c=1
if c<=N:
	d=a[c]
    b[d]=1
    c+=1
print(b)

Submission status: Runtime Error

Solution code:
from fractions import gcd

d = gcd(*map(int, input().split()))
r = 1
for i in range(2, int(d ** 0.5) + 1):
    if d % i == 0:
        d //= i
        r += 1
    while d % i == 0:
        d //= i
print(r + (d > 1))

Submission status: Runtime Error

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

B = []

for i in range(N):
	for k in range(N):
		if i == A[K]:
			B.append(i)

print(B)

Submission status: Runtime Error

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

A = input().split()
for i in range(len(A)):
    ans.append(0)

for i in range(len(A)):
    print(A.index(str(i+1))+1, end=" ")

Submission status: Runtime Error

Solution code:
N=input()
a=list(map(int, input().split()))
b=a
c=1
if c>=N:
	d=a[c]
    b[d]=1
    c+=1
print(b)

Submission status: Runtime Error

Solution code:
N=input()
stu=list(map(int,input().split()))
lis=[x for x in range(N)]
for i in range(N):
  for j in range(N):
    if stu[i]==j:
      lis[j-1]=i+1
print(lis)

Submission status: Runtime Error

Solution code:
import numpy as np

n = int(input())
records= np.array([int(i) for i in input().split()])

enrolled = np.argsort(records)

attendance_num = [i+1 for i in range(len(records))]

attendance_order = attendance_num[enrolled]

print(attendance_order)

Submission status: Runtime Error

Solution code:
from fractions import gcd
from math import sqrt

d = gcd(*map(int, input().split()))
r = 1
for i in range(2, int(sqrt(d)) + 1):
    if d % i == 0:
        d //= i
        r += 1
    while d % i == 0:
        d //= i
print(r + (d > 1))

Submission status: Runtime Error

Solution code:
import numpy as np

n = int(input())
records= np.array([int(i) for i in input().split()])

enrolled = np.argsort(a)

attendance_num = [i+1 for i in range(len(a))]

attendance_order = attendance_num[enrolled]

print(attendance_order)

Submission status: Runtime Error

Solution code:
n = int(input())
a_l = list(map(int, input().split()))
a_d = {}
for i, p in enumerate(a_l):
    a_d[p] = i
res_l = []
for k in sorted(list(a_d.keys())):
    res_l.append(str(a_dt[k]+1))
print(' '.join(res_l))

Submission status: Runtime Error

Solution code:
N = int(input())
ar = list(map(int, input().split()))

arFast = sorted(ar, key=lambda x: x[1], reverse=True)
print(arFast)