Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
import sys
import socket

hostname = socket.gethostname()

if hostname == 'F451C':
    sys.stdin = open('a1.in')


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


def read_str_list():
    return input().split()


def read_int():
    return int(input())


def read_str():
    return input()


def main():
    s = read_str()
    if s[0] == 'Y' and s[1] == 'A' and s[2] == 'K' and s[3] == 'I':
        print('Yes')
    else:
        print('No')


main()


Fixed submission:
import sys
import socket

hostname = socket.gethostname()

if hostname == 'F451C':
    sys.stdin = open('a1.in')


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


def read_str_list():
    return input().split()


def read_int():
    return int(input())


def read_str():
    return input()


def main():
    s = read_str()
    if s[0:4] == 'YAKI':
        print('Yes')
    else:
        print('No')


main()
Buggy python submission (verdict: Runtime Error):
import sys
from collections import Counter

# sys.stdin = open('c1.in')


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


def read_str_list():
    return input().split()


def read_int():
    return int(input())


def read_str():
    return input()


def main():
    n = read_int()
    a = read_int_list()
    a.sort()
    c = Counter(a)
    l = set()
    for i in a:
        if c[i] >= 2:
            l.add(i)
    l = list(l)
    l.sort()

    res = 0
    if len(l) >= 1:
        m = l[-1]
        if c[m] >= 4:
            res = m * m
        else:
            if len(l) >= 2:
                p = l[-2]
                res = m * p
    print(res)
import sys
from collections import Counter

# sys.stdin = open('c1.in')


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


def read_str_list():
    return input().split()


def read_int():
    return int(input())


def read_str():
    return input()


def main():
    n = read_int()
    a = read_int_list()
    a.sort()
    c = Counter(a)
    l = set()
    for i in a:
        if c[i] >= 2:
            l.add(i)
    l = list(l)
    l.sort()

    res = 0
    if len(l) >= 1:
        m = l[-1]
        if c[m] >= 4:
            res = m * m
        else:
            if len(l) >= 2:
                p = l[-2]
                res = m * p
    print(res)


main()


main()


Fixed submission:
import sys
from collections import Counter

# sys.stdin = open('c1.in')


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


def read_str_list():
    return input().split()


def read_int():
    return int(input())


def read_str():
    return input()


def main():
    n = read_int()
    a = read_int_list()
    a.sort()
    c = Counter(a)
    l = set()
    for i in a:
        if c[i] >= 2:
            l.add(i)
    l = list(l)
    l.sort()

    res = 0
    if len(l) >= 1:
        m = l[-1]
        if c[m] >= 4:
            res = m * m
        else:
            if len(l) >= 2:
                p = l[-2]
                res = m * p
    print(res)


main()
Buggy python submission (verdict: Runtime Error):
import sys


# sys.stdin = open('d1.in')


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


def read_str_list():
    return input().split()


def read_int():
    return int(input())


def read_str():
    return input()


def main():
    inf = 10 ** 20
    n = read_int()
    adj = [[] for u in range(n)]
    for i in range(n - 1):
        a, b, c = map(int, input().split())
        a -= 1
        b -= 1
        adj[a].append((b, c))
        adj[b].append((a, c))

    q, k = read_int_list()
    k -= 1
    d = [inf for u in range(n)]

    d[k] = 0
    Q = [(k, -1)]
    while Q:
        u, parent = Q.pop(0)
        for v, w in adj[u]:
            if v == parent:
                continue
            d[v] = d[u] + w
        Q.extend([(v, u) for v, w in adj[u] if v != parent])

    res = [0] * q
    for i in range(q):
        x, y = map(int, input().split())
        res[i] = d[x-1] + d[y-1]
    print(*res, sep='\n')


main()


Fixed submission:
import sys

# sys.stdin = open('a1.in')


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


def read_str_list():
    return input().split()


def read_int():
    return int(input())


def read_str():
    return input()


def main():
    n = read_int()
    if str(n)[0] == str(n)[-1]:
        res = 'Yes'
    else:
        res = 'No'
    print(res)


main()
Buggy python submission (verdict: Runtime Error):
import math

N, A, B = [int(_) for _ in input().split()]
H = sorted([int(input()) for _ in range(N)])

sup = 10 ** 9
inf = 0

while sup - inf > 1:
    x = (sup + inf) // 2
    c = sum([math.ceil((h - x * B) / (A - B)) for h in H if h > x * B])
    if c <= x:
        sup = x
    else:
        inf = x

print(sup)


Fixed submission:
r = list(map(int, input().split()))
s = sum(r)
if s > 9:
    res = 'error'
else:
    res = s
print(res)
Buggy python submission (verdict: Time Limit Exceeded):
import sys


def solve(n, a):
    res = -10 ** 20
    for i in range(n, 2 * n + 1):
        l = a[0:i]
        r = a[i:3 * n]
        l.sort(reverse=True)
        r.sort()
        res0 = sum(l[0:n]) - sum(r[0:n])
        if res0 > res:
            res = res0
    return res


# sys.stdin = open('d1.in')
n = int(input())
a = list(map(int, input().split()))
print(solve(n, a))

Fixed submission:
import os
import sys
import heapq


def solve(n, a):
    res = -10 ** 20
    for i in range(n, 2 * n + 1):
        l = a[0:i]
        r = a[i:3 * n]
        l.sort(reverse=True)
        r.sort()
        res0 = sum(l[0:n]) - sum(r[0:n])
        if res0 > res:
            res = res0
    return res


def find_best(n, a):
    h = list()
    s = 0
    best_s = -10**20
    res = list()
    for i in range(0, 2 * n):
        heapq.heappush(h, a[i])
        s += a[i]
        if len(h) > n:
            m = heapq.heappop(h)
            s -= m
        if len(h) == n:
            if best_s < s:
                best_s = s
            res.append(best_s)
    return res


def solve_large(n, a):
    res = -10 ** 20
    max_l = find_best(n, a)
    b = [-x for x in reversed(a)]
    max_r = find_best(n, b)
    max_r.reverse()
    for l, r in zip(max_l, max_r):
        res0 = l + r
        if res < res0:
            res = res0
    return res


input_file = 'd1.in'
if os.path.exists(input_file):
    sys.stdin = open(input_file)
n = int(input())
a = list(map(int, input().split()))
print(solve_large(n, a))
Buggy python submission (verdict: Time Limit Exceeded):
import sys

# sys.stdin = open('d1.in')

n, m = map(int, input().split())
weights = {}
for i in range(m):
    a, b, c = map(int, input().split())
    a -= 1
    b -= 1
    weights[(a, b)] = c

score = [-10 ** 50] * n
score[0] = 0
pred = [-1] * n
for i in range(n):
    for edge, c in weights.items():
        a, b = edge
        if score[b] < score[a] + c:
            score[b] = score[a] + c
            pred[b] = a
res = score[n - 1]

b = n - 1
while b != 0:
    a = pred[b]
    c = weights[(a, b)]
    if score[b] < score[a] + c:
        res = 'inf'
    b = a

print(res)


Fixed submission:
import sys

# sys.stdin = open('d1.in')

n, m = map(int, input().split())
edges = []
for i in range(m):
    a, b, c = map(int, input().split())
    a -= 1
    b -= 1
    edges.append((a, b, c))

score = [-10 ** 50] * n
score[0] = 0
for i in range(n):
    for a, b, c in edges:
        if score[b] < score[a] + c:
            score[b] = score[a] + c
res = score[n - 1]

for i in range(n):
    for a, b, c in edges:
        if score[b] < score[a] + c:
            score[b] = score[a] + c
if res < score[n - 1]:
    res = 'inf'
print(res)
Buggy python submission (verdict: Runtime Error):
import sys
from math import gcd

# sys.stdin = open('b1.in')

a, b, c = map(int, input().split())

d = gcd(a, b)
if c % d == 0:
    print('YES')
else:
    print('NO')


Fixed submission:
import sys

# sys.stdin=open('b1.in')

a, b, c = map(int, input().split())

res = 'NO'
for k in range(1, b + 1):
    if k * a % b == c:
        res = 'YES'
        break
print(res)
Buggy python submission (verdict: Time Limit Exceeded):
import sys

# sys.stdin = open('b1.in')


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


def read_str_list():
    return input().split()


def read_int():
    return int(input())


def read_str():
    return input()


def main():
    k, s = read_int_list()
    res = 0
    for x in range(0, k + 1):
        for y in range(0, k + 1):
            for z in range(0, k + 1):
                if s == x + y + z:
                    res += 1
    print(res)


main()


Fixed submission:
import sys

# sys.stdin = open('b1.in')


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


def read_str_list():
    return input().split()


def read_int():
    return int(input())


def read_str():
    return input()


def main():
    k, s = read_int_list()
    res = 0
    for x in range(0, k + 1):
        for y in range(0, k + 1):
            z = s - (x + y)
            if 0 <= z <= k:
                res += 1
    print(res)


main()
Buggy python submission (verdict: Runtime Error):
pronunciation = {0: 'pon', 1: 'pon', 2: 'hon', 3: 'bon', 4: 'hon', 5: 'hon', 6: 'pon', 7: 'hon', 8: 'pon', 9: 'hon'}
input = input()
if len(input) > 1:
  input = int(input[-1])
print(pronunciation[input])


Fixed submission:
pronunciation = {0: 'pon', 1: 'pon', 2: 'hon', 3: 'bon', 4: 'hon', 5: 'hon', 6: 'pon', 7: 'hon', 8: 'pon', 9: 'hon'}
input = input()
if len(input) > 1:
  input = int(input[-1])
if type(input) != int:
    input = int(input)
print(pronunciation[input])

Buggy python submission (verdict: Runtime Error):
pronunciation = {0: 'pon', 1: 'pon', 2: 'hon', 3: 'bon', 4: 'hon', 5: 'hon', 6: 'pon', 7: 'hon', 8: 'pon', 9: 'hon'}
input = int(input())
print(pronunciation[input])

Fixed submission:
pronunciation = {0: 'pon', 1: 'pon', 2: 'hon', 3: 'bon', 4: 'hon', 5: 'hon', 6: 'pon', 7: 'hon', 8: 'pon', 9: 'hon'}
input = input()
if len(input) > 1:
  input = int(input[-1])
if type(input) != int:
    input = int(input)
print(pronunciation[input])
Buggy python submission (verdict: Runtime Error):
k = int(input())
s = int(input())
if len(s) > k:
  print(s[:k])
else:
  print(s)

Fixed submission:
k = int(input())
s = input()
if len(s) > k:
  print(s[:k] + '...')
else:
  print(s)
Buggy python submission (verdict: Runtime Error):
N = input()
r = N%10
if r == 2 or r==4 or r==5 or r==7 or r==9:
  print('hon')
elif r == 0 or r == 1 or r == 6 or r == 8:
  print('pon')
else:
  print('bon')


Fixed submission:
N = int(input())
r = N % 10
if r == 2 or r==4 or r==5 or r==7 or r==9:
  print('hon')
elif r == 0 or r == 1 or r == 6 or r == 8:
  print('pon')
else:
  print('bon')
Buggy python submission (verdict: Runtime Error):
k = int(input())
a, b = [int(i) for i in input().split]

if a % k == 0 or (a % k - b % k) >= 0:
  print('OK')
else:
  print('NG')

Fixed submission:
k = int(input())
a, b = [int(i) for i in input().split()]

if b-a >= k-1:
  print('OK')
elif a % k - b % k > 0 or a % k == 0:
  print('OK')
else:
  print('NG')

Buggy python submission (verdict: Runtime Error):
k = int(input())
a = int(input())
b = int(input())

if a % k == 0 or (a % k - b % k) >= 0:
  print('OK')
else:
  print('NG')

Fixed submission:
k = int(input())
a, b = [int(i) for i in input().split()]

if b-a >= k-1:
  print('OK')
elif a % k - b % k > 0 or a % k == 0:
  print('OK')
else:
  print('NG')
Buggy python submission (verdict: Runtime Error):
N=input()
if N[-1] == "3":
  return "bon"

Fixed submission:
N=input()
if N[-1] == "3":
  print("bon")
elif int(N[-1]) in [2,4,5,7,9]:
  print("hon")
else:
  print("pon")

Buggy python submission (verdict: Runtime Error):
N

Fixed submission:
N=input()
if N[-1] == "3":
  print("bon")
elif int(N[-1]) in [2,4,5,7,9]:
  print("hon")
else:
  print("pon")
Buggy python submission (verdict: Runtime Error):
K=input()
S=input()
if len(S) <= K:
  print(S)
else:
  print(S[:K]+"...")

Fixed submission:
K=int(input())
S=input()
if len(S) <= K:
  print(S)
else:
  print(S[:K]+"...")
Buggy python submission (verdict: Runtime Error):
a, b = map(int, raw_input().split())
if(a+b<11):
    print(a+b)
else:
    print("error")

Fixed submission:
a, b = map(int, input().split())
if(a+b<10):
    print(a+b)
else:
    print("error")
Buggy python submission (verdict: Runtime Error):
s = str(input())
f = "yes"
for i in range(0,len(s)):
    if s.count(i) != 1:
        f = "no"
        break
print(f)

Fixed submission:
s = str(input())
f = "yes"
for i in range(0,len(s)):
    if s.count(s[i]) != 1:
        f = "no"
        break
print(f)
Buggy python submission (verdict: Runtime Error):
#!/usr/bin/env python3

[N, M] = [int(x) for x in input().split(" ")]
A = [int(x) for x in input().split(" ")]

ret = 0
for l in range(0, N):
    Sum = 0
    for r in range(l, N):
        Sum += A[r]
        if Sum % M == 0:
            ret += 1
print(ret)


Fixed submission:
#!/usr/bin/env python3

[N, K] = [int(x) for x in input().split(" ")]
print(0 if (N % K == 0) else 1)
Buggy python submission (verdict: Runtime Error):
#!/usr/bin/env python
# -*- coding: utf-8 -*-

(A, B, C) = [int(x) for x in raw_input().split(" ")]

if A == B:
    print(C)
elif A == C:
    print(B)
else:
    print(A)


Fixed submission:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

(A, B, C) = [int(x) for x in input().split(" ")]

if A == B:
    print(C)
elif A == C:
    print(B)
else:
    print(A)
Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
ls=[]
n=0
for i in range(N):
    ln=sorted(input())
    n+=ls.count(ln)
    ls.append(ln)
print(n)        


Fixed submission:
N=int(input())
dic={}
ans=0
for i in range(N):
    str1=''.join(sorted(input()))
    n=len(str1)
    if n in dic:
        if str1 in dic[n]:
            ans+=dic[n][str1]
            dic[n][str1]+=1
        else:
            dic[n][str1]=1
    else:
        dic[n]={str1:1}
    
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
ls=[]
n=0
for i in range(N):
    str1=''.join(sorted(input()))
    n+=ls.count(str1)
    ls.append(str1)
print(n)        


Fixed submission:
N=int(input())
dic={}
ans=0
for i in range(N):
    str1=''.join(sorted(input()))
    n=len(str1)
    if n in dic:
        if str1 in dic[n]:
            ans+=dic[n][str1]
            dic[n][str1]+=1
        else:
            dic[n][str1]=1
    else:
        dic[n]={str1:1}
    
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
ls=[]
n=0
for i in range(N):
    str1=''.join(sorted(input()))
    if str1 in ls:
        n+=ls.count(str1)
        ls.append(str1)
    else:
        ls.append(str1)
print(n)        

Fixed submission:
N=int(input())
dic={}
ans=0
for i in range(N):
    str1=''.join(sorted(input()))
    n=len(str1)
    if n in dic:
        if str1 in dic[n]:
            ans+=dic[n][str1]
            dic[n][str1]+=1
        else:
            dic[n][str1]=1
    else:
        dic[n]={str1:1}
    
print(ans)
Buggy python submission (verdict: Runtime Error):
K = int(input())
S = input()

if len(S) <= K:
    print(S)
else:
    print(S[0:K]　+ "...")

Fixed submission:
N = int(input())
N = N % 10
if N in [2, 4, 5, 7, 9]:
    print('hon')

elif N in [0, 1, 6, 8]:
    print('pon')

else:
    print('bon')

Buggy python submission (verdict: Runtime Error):
K = int(input())
S = input()

if len(S) <= K:
    print(S)
else:
    print(S[0:K]　+ '...')

Fixed submission:
N = int(input())
N = N % 10
if N in [2, 4, 5, 7, 9]:
    print('hon')

elif N in [0, 1, 6, 8]:
    print('pon')

else:
    print('bon')

Buggy python submission (verdict: Runtime Error):
K = int(input())
S = input()

if len(S) <= K:
    print(S)
else
    print(S[0:K]　+ '...')

Fixed submission:
N = int(input())
N = N % 10
if N in [2, 4, 5, 7, 9]:
    print('hon')

elif N in [0, 1, 6, 8]:
    print('pon')

else:
    print('bon')

Buggy python submission (verdict: Runtime Error):
S = input()
K = int(input())

if len(S) <= K:
    print(S)
else
    print(S[0:K]　+ '...')

Fixed submission:
N = int(input())
N = N % 10
if N in [2, 4, 5, 7, 9]:
    print('hon')

elif N in [0, 1, 6, 8]:
    print('pon')

else:
    print('bon')

Buggy python submission (verdict: Runtime Error):
S = input()
K = int(input())

if len(S) <= K:
    print(S)
else
    S = S[0:K]　+ '...'
    print(S)

Fixed submission:
N = int(input())
N = N % 10
if N in [2, 4, 5, 7, 9]:
    print('hon')

elif N in [0, 1, 6, 8]:
    print('pon')

else:
    print('bon')

Buggy python submission (verdict: Runtime Error):
N = input()
N = N % 10
if N in [2, 4, 5, 7, 9]:
    print('hon')

elif N in [0, 1, 6, 8]:
    print('pon')

else:
    print('bon')

Fixed submission:
N = int(input())
N = N % 10
if N in [2, 4, 5, 7, 9]:
    print('hon')

elif N in [0, 1, 6, 8]:
    print('pon')

else:
    print('bon')

Buggy python submission (verdict: Runtime Error):
N = int(input(N))
N = N % 10
if N in 2, 4, 5, 7, 9:
    print('hon')

elif N in 0, 1, 6, 8:
    print('pon')

else:
    print('bon')

Fixed submission:
N = int(input())
N = N % 10
if N in [2, 4, 5, 7, 9]:
    print('hon')

elif N in [0, 1, 6, 8]:
    print('pon')

else:
    print('bon')

Buggy python submission (verdict: Runtime Error):
N = input(N)
N = N % 10
if N in 2, 4, 5, 7, 9:
    print('hon')

elif N in 0, 1, 6, 8:
    print('pon')

else:
    print('bon')

Fixed submission:
N = int(input())
N = N % 10
if N in [2, 4, 5, 7, 9]:
    print('hon')

elif N in [0, 1, 6, 8]:
    print('pon')

else:
    print('bon')

Buggy python submission (verdict: Runtime Error):
N = input(N)
N = N % 10
if(N == 2, 4, 5, 7, 9):
    print('hon')

elif(N == 0, 1, 6, 8):
    print('pon')

else:
    print('bon')

Fixed submission:
N = int(input())
N = N % 10
if N in [2, 4, 5, 7, 9]:
    print('hon')

elif N in [0, 1, 6, 8]:
    print('pon')

else:
    print('bon')
Buggy python submission (verdict: Runtime Error):
N = int(input())
s = N-1
a = N
b = 1
for i in range(int(N**0.5)+1, 1, -1):
        if N%i == 0:
            a = i
            b = N//i
            s = a + b -2
            break

print(s)

Fixed submission:
A, B = map(int, input().split())
if (1 <= A <= 9) & (1 <= B <= 9):
    s = A*B
    print(s)

else:
    print(-1)

Buggy python submission (verdict: Runtime Error):
N = int(input())
s = N-1
for i in range(1, int(N**0.5) + 1):
    for j in range(1, int(N**0.5) + 1):
        if N == i * j:
            flag = i + j - 2

            if flag <= s:
                s = flag

print(s)

Fixed submission:
A, B = map(int, input().split())
if (1 <= A <= 9) & (1 <= B <= 9):
    s = A*B
    print(s)

else:
    print(-1)

Buggy python submission (verdict: Runtime Error):
A = int(input())
B = int(input())
if (1 <= A <= 9) & (1 <= B <= 9):
    s = A*B
    print(s)

else:
    print(-1)

Fixed submission:
A, B = map(int, input().split())
if (1 <= A <= 9) & (1 <= B <= 9):
    s = A*B
    print(s)

else:
    print(-1)

Buggy python submission (verdict: Runtime Error):
# 問題文
# 高橋君は九九を覚えたので、1以上 9以下の 2つの整数の積を計算することができます。それ以外の計算はできません。
# 2つの整数 A, Bが与えられます。
# 高橋君が A×Bを計算できるならその結果を、できないなら代わりに -1 を出力してください。
# 制約
# 1≤A≤20
# 1≤B≤20
# 入力中のすべての値は整数である。
A = int(input())
B = int(input())
if (1 <= A <= 9) & (1 <= B <= 9):
    s = A*B
    print(s)

else:
    print(-1)

Fixed submission:
A, B = map(int, input().split())
if (1 <= A <= 9) & (1 <= B <= 9):
    s = A*B
    print(s)

else:
    print(-1)
Buggy python submission (verdict: Runtime Error):
 N = int(input())
s = N-1
for i in range(1, int(N**0.5) + 1):
    for j in range(1, int(N**0.5) + 1):
        if N == i * j:
            flag = i + j - 2

            if flag <= s:
                s = flag

print(s)

Fixed submission:

N = int(input())
s = N-1
a = N
b = 1
for i in range(int(N**0.5)+1, 1, -1):
        if N%i == 0:
            a = i
            b = N//i
            s = a + b -2
            break

print(s)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
s = N
for i in range(1, N+1):
    for j in range(1, N+1):
        if N == i * j:
            flag = i + j - 2

            if flag <= s:
                s = flag

print(s)

Fixed submission:

N = int(input())
s = N-1
a = N
b = 1
for i in range(int(N**0.5)+1, 1, -1):
        if N%i == 0:
            a = i
            b = N//i
            s = a + b -2
            break

print(s)
Buggy python submission (verdict: Runtime Error):
s = input() 
t = input()

ans = 0

for i in range(3):
	if s[i]=t[i]:
		ans += ans

print(ans)

Fixed submission:
s = input()
t = input()

ans = 0

for i in range(3):
	if s[i]==t[i]:
		ans += 1
print(ans)

Buggy python submission (verdict: Runtime Error):
s = input() 
t = input()

ans = 0

for i in range(3){
	if s[i]=t[i]
		ans += ans

print(ans)

Fixed submission:
s = input()
t = input()

ans = 0

for i in range(3):
	if s[i]==t[i]:
		ans += 1
print(ans)
Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
sum = 1
result = 0
while sum < b:
     sum = sum -1 + a
     result += 1

print(result)

Fixed submission:
a,b = map(int, input().split())
sum = 1
result = 0
while sum < b:
     sum = sum -1 + a
     result += 1

print(result)
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
a=input().split()
sp=' '
ans=''
for i in range(n):
	if i!=0:
		ans+=sp
	ans+=str(a.index(str(i+1))+1)
print(ans)

Fixed submission:
n=int(input())
a=input().split()
lans=[int(i) for i in range(n)]
sp=' '
ans=''

for i in range(n):
	lans[int(a[i])-1]=i+1
ans+=str(lans[0])
for i in range(1,n):
	ans+=sp
	ans+=str(lans[i])
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
a=input().split()
for i in range(n):
	a[i]=int(a[i])
sp=' '
ans=''
for i in range(1,n+1):
	if i!=1:
		ans+=sp
	ans+=str(a.index(i)+1)
print(ans)

Fixed submission:
n=int(input())
a=input().split()
lans=[int(i) for i in range(n)]
sp=' '
ans=''

for i in range(n):
	lans[int(a[i])-1]=i+1
ans+=str(lans[0])
for i in range(1,n):
	ans+=sp
	ans+=str(lans[i])
print(ans)
Buggy python submission (verdict: Runtime Error):
n=int(input())
print(n*(n-1)//2)

Fixed submission:
s=input()
t=input()
ans=0
for i in range(3):
	if s[i]==t[i]:
		ans+=1
print(ans)
Buggy python submission (verdict: Runtime Error):
n=int(input())
a=[int(input()) for i in range(n)]
b=sorted(a,reverse=True)
x,y=b[0],b[1]
z=a.index(x)
for i in range(n):
	if i==z:
		print(y)
	else:
		print(x)

Fixed submission:
print(3*(int(input())**2))
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
a=[int(input()) for i in range(n)]
b=sorted(a,reverse=True)
x,y=b[0],b[1]
for i in range(n):
	if i==a.index(x):
		print(y)
	else:
		print(x)

Fixed submission:
n=int(input())
a=[int(input()) for i in range(n)]
b=sorted(a,reverse=True)
x,y=b[0],b[1]
z=a.index(x)
for i in range(n):
	if i==z:
		print(y)
	else:
		print(x)

Buggy python submission (verdict: Time Limit Exceeded):
import copy
n=int(input())
a=[int(input()) for i in range(n)]
for i in range(n):
	b=copy.copy(a)
	del b[i]
	print(max(b))

Fixed submission:
n=int(input())
a=[int(input()) for i in range(n)]
b=sorted(a,reverse=True)
x,y=b[0],b[1]
z=a.index(x)
for i in range(n):
	if i==z:
		print(y)
	else:
		print(x)
Buggy python submission (verdict: Runtime Error):
x,y,z=map(int,input().split())

ans=x*y/2

print(int(k))

Fixed submission:
x,y,z=map(int,input().split())

ans=x*y/2

print('{:.0f}'.format(ans))
Buggy python submission (verdict: Runtime Error):
n=int(input())
la=[int(i) for i in input().split()]
la.sort(reverse=True)
ans=-1
t3=0

while t3!=n:
    f=0
    t3=0
    for i in range(n):
        if f==0 and la[i]%2==0:
            la[i]=la[i]/2
            f=1
        else:
            la[i]=la[i]*3
            t3+=1
    ans+=1

print(ans)

Fixed submission:
n=int(input())
la=[int(i) for i in input().split()]
ans=0

for i in range(n):
    while la[i]%2==0:
        la[i]=la[i]/2
        ans+=1

print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
a,b,x=map(int,input().split())
c=0

for i in range(a,b+1):
    if i%x==0:
        c+=1
        
print(c)

Fixed submission:
a,b,x=map(int,input().split())

print(b//x-(a-1)//x)