Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
def resolve():
    n = int(input())
    l = list(map(int, input().split()))
    c = collections.Counter(l)
    keys = c.keys()
    key_combinations = set(itertools.combinations(keys, 3))

    result = 0
    for combination in key_combinations:
        max_key = max(combination)
        if sum(combination) - max_key > max_key:
            # 三角形になる
            one_combination_result = 1
            for key in combination:
                one_combination_result = one_combination_result * c[key]
            result += one_combination_result
    print(result)
resolve()

Fixed submission:
import collections
import itertools
def resolve():
    n = int(input())
    l = list(map(int, input().split()))
    c = collections.Counter(l)
    keys = c.keys()
    key_combinations = set(itertools.combinations(keys, 3))

    result = 0
    for combination in key_combinations:
        max_key = max(combination)
        if sum(combination) - max_key > max_key:
            # 三角形になる
            one_combination_result = 1
            for key in combination:
                one_combination_result = one_combination_result * c[key]
            result += one_combination_result
    print(result)
resolve()
Buggy python submission (verdict: Runtime Error):
def resolve():
    H,W,K = map(int,input().split())
    bi = []
    bj = []
    for i in range(H):
        row = input()
        for j in range(W):
            if row[j]=='#':
                bi.append(i)
                bj.append(j)

    row_iters = [itertools.combinations(range(H), i) for i in range(0,H+1)]
    column_iters = [itertools.combinations(range(W), i) for i in range(0,W+1)]

    dellist = lambda items, indexes: [item for index, item in enumerate(items) if index not in indexes]
    # 行を削除してみる
    count = 0

    for row_iters in row_iters:
        for target_rows in row_iters:
            row_del_position = [i_position for i_position, i in enumerate(bi) for target_row in target_rows if i == target_row]
            new_bi = dellist(bi, row_del_position)
            new_bj = dellist(bj, row_del_position)
            if len(new_bi)>=K:
                for column_iters in column_iters:
                    for target_columns in column_iters:
                        column_del_position = [j_position for j_position, j in enumerate(bj) for target_column in target_columns if j == target_column]
                        new_bi = dellist(bi, column_del_position)
                        new_bj = dellist(bj, column_del_position)
                        if len(new_bi) == K:
                            count +=1
    print(count)
resolve()

Fixed submission:
import itertools
def resolve():
    H,W,K = map(int,input().split())
    bi = []
    bj = []
    for i in range(H):
        row = input()
        for j in range(W):
            if row[j]=='#':
                bi.append(i)
                bj.append(j)
    
    dellist = lambda items, indexes: [item for index, item in enumerate(items) if index not in indexes]
    # 行を削除してみる
    count = 0

    row_iters = [itertools.combinations(range(H), i) for i in range(0,H+1)]
    for row_iter in row_iters:
        for target_rows in row_iter:
            row_del_position = [i_position for i_position, i in enumerate(bi) for target_row in target_rows if i == target_row]
            #new_bi = dellist(bi, row_del_position)
            new_bj = dellist(bj, row_del_position)
            if len(new_bj)>=K:
                #print('bi>=K')
                #print(target_rows)
                #print(new_bi, new_bj)
                column_iters = [itertools.combinations(range(W), i) for i in range(0,W+1)]
                for column_iter in column_iters:
                    for target_columns in column_iter:
                        column_del_position = [j_position for j_position, j in enumerate(new_bj) for target_column in target_columns if j == target_column]
                        #new_bi2 = dellist(new_bi, column_del_position)
                        new_bj2 = dellist(new_bj, column_del_position)
                        
                        if len(new_bj2) == K:
                            #print('bi==K')
                            #print(target_columns)
                            count +=1
    print(count)
resolve()
Buggy python submission (verdict: Runtime Error):
N = int(input())
num = list(map(int,input().split()))
a = 1
for n in range(N):
  a = num[n]*a
if a> 10**18:
  a=-1
print(a)

Fixed submission:
A, B = map(int, input().split())
print(A*B)

Buggy python submission (verdict: Runtime Error):
import numpy as np
N = int(input())
num = np.array(list(map(int,input().split())))

a = np.prod(num)
if a> 10**18:
  a=-1
print(a)

Fixed submission:
A, B = map(int, input().split())
print(A*B)

Buggy python submission (verdict: Runtime Error):
A, B = input().split()
print(A*B)

Fixed submission:
A, B = map(int, input().split())
print(A*B)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
num = list(map(int,input().split()))
a = 1
for n in range(N):
  a = num[n]*a
if a> 10**18:
  a=-1
print(a)


Fixed submission:
import sys
N = int(input())
num = list(map(int,input().split()))
num.sort(reverse=True)
a = 1
if num[-1] == 0:
  print(0)
else:
  for n in range(N):
    a = num[n]*a
    if a> 10**18:
      print(-1)
      sys.exit()
  print(a)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
num = list(map(int,input().split()))
a = 1
for n in num:
  a = n*a
if a> 10**18:
  a=-1
print(a)

Fixed submission:
import sys
N = int(input())
num = list(map(int,input().split()))
num.sort(reverse=True)
a = 1
if num[-1] == 0:
  print(0)
else:
  for n in range(N):
    a = num[n]*a
    if a> 10**18:
      print(-1)
      sys.exit()
  print(a)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
num = list(map(int,input().split()))
if 0 in set(num):
  print(0)
else:
  a = 1
  for n in num:
    a = n*a
  if a> 10**18:
    a=-1
  print(a)

Fixed submission:
import sys
N = int(input())
num = list(map(int,input().split()))
num.sort(reverse=True)
a = 1
if num[-1] == 0:
  print(0)
else:
  for n in range(N):
    a = num[n]*a
    if a> 10**18:
      print(-1)
      sys.exit()
  print(a)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
num = list(map(int,input().split()))
if 0 in num:
  print(0)
else:
  a = 1
  for n in num:
    a = n*a
  if a> 10**18:
    a=-1
  print(a)


Fixed submission:
import sys
N = int(input())
num = list(map(int,input().split()))
num.sort(reverse=True)
a = 1
if num[-1] == 0:
  print(0)
else:
  for n in range(N):
    a = num[n]*a
    if a> 10**18:
      print(-1)
      sys.exit()
  print(a)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
num = list(map(int,input().split()))
a = 1
for n in num:
  a = n*a
if a> 10**18:
  a=-1
print(a)

Fixed submission:
import sys
N = int(input())
num = list(map(int,input().split()))
num.sort(reverse=True)
a = 1
if num[-1] == 0:
  print(0)
else:
  for n in range(N):
    a = num[n]*a
    if a> 10**18:
      print(-1)
      sys.exit()
  print(a)

Buggy python submission (verdict: Runtime Error):
N = int(input().split())
num = list(map(int,input().split()))
a = 1
for n in num:
  a = n*a
if a> 10**18:
  a=1
print(a)

Fixed submission:
import sys
N = int(input())
num = list(map(int,input().split()))
num.sort(reverse=True)
a = 1
if num[-1] == 0:
  print(0)
else:
  for n in range(N):
    a = num[n]*a
    if a> 10**18:
      print(-1)
      sys.exit()
  print(a)
Buggy python submission (verdict: Runtime Error):
import math
A, B = map(int, input()split())
print(math.floor(A*B))

Fixed submission:
from decimal import Decimal
import math
A, B = input().split()
A = Decimal(A)
B = Decimal(B)
ans = A*B
print(math.floor(ans))
Buggy python submission (verdict: Runtime Error):
import numpy as np
room, route_count = map(int,input().split())
route = np.array([list(map(int,input().split())) for _ in range(route_count)])
 
object_nums = [1]
ans = np.array([0]*(room-1))
 
def mem_ans(ans, object_num, next_nums):
    next_nums = next_nums - 2
    ans[next_nums-2] = object_num
    return ans
 
for object_num in object_nums:
    object_rows = route[np.any(route==object_num, axis=1)]
    route = route[~np.any(route==object_num, axis=1)]
    next_nums = object_rows[object_rows!=object_num]
    
    if next_nums is not None:
        ans = mem_ans(ans, object_num, next_nums)
        object_nums.extend(next_nums)
    else:
        break
if 0 in set(ans):
  print('No')
else:
  print('Yes')
  for i in ans:
    print(i)

Fixed submission:
count = int(input()[-1])
if count == 2 or count == 4 or count == 5 or count == 7 or count == 9:
  print('hon')
elif count == 3:
  print('bon')
else:
  print('pon')
Buggy python submission (verdict: Runtime Error):
input = input()
if input='ABC':
  print('ARC')
else:
  print('ABC')

Fixed submission:
x = str(input())
if x == 'ABC':
  print('ARC')
else:
  print('ABC')
Buggy python submission (verdict: Runtime Error):
N, K = map(int, input().split())
mem = set()
for _ in range(K):
  _ = input()
  mem = mem | {input().split()}

mem_count = len(mem)
print(N-mem_count)

Fixed submission:
N, K = map(int, input().split())
mem = set()
for _ in range(K):
  _ = input()
  mem = mem | set(map(int, input().split()))

mem_count = len(mem)
print(N-mem_count)

Buggy python submission (verdict: Runtime Error):
N, K = map(int, input().split())
mem = set()
for _ in range(K):
  _ = input()
  mem = mem | {input().split()}
mem_count = len(mem)
print(N-mem_count)

Fixed submission:
N, K = map(int, input().split())
mem = set()
for _ in range(K):
  _ = input()
  mem = mem | set(map(int, input().split()))

mem_count = len(mem)
print(N-mem_count)

Buggy python submission (verdict: Runtime Error):
N, K = map(int, input().split())
mem = {}
for _ in range(K):
  _ = input()
  mem = mem | {input().split()}

mem_count = len(mem)
print(N-mem_count)

Fixed submission:
N, K = map(int, input().split())
mem = set()
for _ in range(K):
  _ = input()
  mem = mem | set(map(int, input().split()))

mem_count = len(mem)
print(N-mem_count)
Buggy python submission (verdict: Runtime Error):
s = input()
t = input()

s_len =len(s)
t_len =len(t)
count = 0
ans = []



for i in range(s_len - t_len):
    for j in range(t_len):
        if s[i:t_len + i][j] != t[j]:
            count += 1
    ans.append(count)
    count = 0

min_ans = min(ans)
print(min_ans)



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

s_len =len(s)
t_len =len(t)
count = 0
ans = []



for i in range(s_len - t_len + 1):
    for j in range(t_len):
        if s[i:t_len + i][j] != t[j]:
            count += 1
    ans.append(count)
    count = 0

min_ans = min(ans)
print(min_ans)

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

s_len =len(s)
t_len =len(t)
count = 0



for i in range(s_len - t_len):
    for j in range(t_len):
        if s[i:t_len][j] != t[j]
            count += 1
    print(count)

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

s_len =len(s)
t_len =len(t)
count = 0
ans = []



for i in range(s_len - t_len + 1):
    for j in range(t_len):
        if s[i:t_len + i][j] != t[j]:
            count += 1
    ans.append(count)
    count = 0

min_ans = min(ans)
print(min_ans)
Buggy python submission (verdict: Runtime Error):
A, B, C = map(int,input().split())

K = int(input())


for i in range(0, K):
    for j in range(0, K):
        for k in range(0, K):
            x = A * 2**i
            y = B * 2**j
            z = C * 2**k

            if x < y < z:
                flag = True
                

if flag == True:
    print('Yes')
else:
    print('No')

Fixed submission:
A, B, C = map(int,input().split())

K = int(input())

flag = False

for i in range(0, K+1):
    for j in range(0, K+1):
        for k in range(0, K+1):
            x = A * 2**i
            y = B * 2**j
            z = C * 2**k
            # print(x, y, z)

            if x < y < z and i + j + k <= K:
                flag = True


if flag == True:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Time Limit Exceeded):
from operator import mul
from functools import reduce

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

hyouten_count = N - K

result_list = []

result = 1

for i in range(K-1, N):
    # print(num)
    # result = 1
    num = i-K+1
    result = reduce(mul, A[num:i+1])
    # for j in range(K):
    #     result = result * A[i - j]
    # print(result)
    # print(result)
    result_list.append(result)
    result = 1


for n in range(1, len(result_list)):
    if result_list[n] > result_list[n-1]:
        print('Yes')
    else:
        print('No')

Fixed submission:
N, K = map(int,input().split())
A = list(map(int, input().split()))


for i in range(K, N): # 3, 5
    if A[i] > A[i-K]:
        print('Yes')
    else:
        print('No')

Buggy python submission (verdict: Time Limit Exceeded):
# from operator import mul
# from functools import reduce

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

hyouten_count = N - K

result_list = []

for i in range(K-1, N):
    # num = reduce(mul, A[0:i])
    # print(num)
    result = 1
    for j in range(K):
        result = result * A[i - j]
    # print(result)
    result_list.append(result)


for n in range(1, len(result_list)):
    if result_list[n] > result_list[n-1]:
        print('Yes')
    else:
        print('No')

Fixed submission:
N, K = map(int,input().split())
A = list(map(int, input().split()))


for i in range(K, N): # 3, 5
    if A[i] > A[i-K]:
        print('Yes')
    else:
        print('No')
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = [input()) for i in range(n)]

c0, c1, c2, c3 = 0, 0, 0, 0

for output in a:
    if output == 'AC':
        c0 += 1
    elif output == 'WA':
        c1 += 1
    elif output == 'TLE':
        c2 += 1
    elif output == 'RE':
        c3 += 1
        
        
print('AC x {}'.format(c0))
print('WA x {}'.format(c1))
print('TLE x {}'.format(c2))
print('RE x {}'.format(c3))

Fixed submission:
n = int(input())
a = [input() for i in range(n)]

c0, c1, c2, c3 = 0, 0, 0, 0

for output in a:
    if output == 'AC':
        c0 += 1
    elif output == 'WA':
        c1 += 1
    elif output == 'TLE':
        c2 += 1
    elif output == 'RE':
        c3 += 1
        
        
print('AC x {}'.format(c0))
print('WA x {}'.format(c1))
print('TLE x {}'.format(c2))
print('RE x {}'.format(c3))

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = [int(input()) for i in range(n)]

c0, c1, c2, c3 = 0, 0, 0, 0

for output in a:
    if output == 'AC':
        c0 += 1
    elif output == 'WA':
        c1 += 1
    elif output == 'TLE':
        c2 += 1
    elif output == 'RE':
        c3 += 1
        
        
print('AC x {}'.format(c0))
print('WA x {}'.format(c1))
print('TLE x {}'.format(c2))
print('RE x {}'.format(c3))

Fixed submission:
n = int(input())
a = [input() for i in range(n)]

c0, c1, c2, c3 = 0, 0, 0, 0

for output in a:
    if output == 'AC':
        c0 += 1
    elif output == 'WA':
        c1 += 1
    elif output == 'TLE':
        c2 += 1
    elif output == 'RE':
        c3 += 1
        
        
print('AC x {}'.format(c0))
print('WA x {}'.format(c1))
print('TLE x {}'.format(c2))
print('RE x {}'.format(c3))
Buggy python submission (verdict: Runtime Error):
#intの場合


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

for i in range(len[huga]):
    if huga[i] == 0:
        print(huga[i])

Fixed submission:
#intの場合


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

if huga[0] == 0:
    print(1)
if huga[1] == 0:
    print(2)
if huga[2] == 0:
    print(3)
if huga[3] == 0:
    print(4)
if huga[4] == 0:
    print(5)
Buggy python submission (verdict: Runtime Error):
#intの場合
N = int(input()) #ここで標準入力

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

# multiple = 1
# for i in range(N):
#     multiple *= A[i]



# if multiple <= 10 ** 18 :
#     print(multiple)
# else:
#     print(-1)


if 0 in A:
    print(0)
    return

output = 1
for a in A:
    output *= a
    
    if output > 10 ** 18:
        print(-1)
        return

print(output)


Fixed submission:
#intの場合
N = int(input()) #ここで標準入力

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

# multiple = 1
# for i in range(N):
#     multiple *= A[i]



# if multiple <= 10 ** 18 :
#     print(multiple)
# else:
#     print(-1)

def main():
    if 0 in A:
        print(0)
        return

    output = 1
    for a in A:
        output *= a

        if output > (10 ** 18):
            print(-1)
            return

    print(output)

main()

Buggy python submission (verdict: Time Limit Exceeded):
#intの場合
N = int(input()) #ここで標準入力

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

multiple = 1
for i in range(N):
    multiple *= A[i]



if multiple <= 10 ** 18 :
    print(multiple)
else:
    print(-1)


Fixed submission:
#intの場合
N = int(input()) #ここで標準入力

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

# multiple = 1
# for i in range(N):
#     multiple *= A[i]



# if multiple <= 10 ** 18 :
#     print(multiple)
# else:
#     print(-1)

def main():
    if 0 in A:
        print(0)
        return

    output = 1
    for a in A:
        output *= a

        if output > (10 ** 18):
            print(-1)
            return

    print(output)

main()
Buggy python submission (verdict: Runtime Error):
A = int(input()) #ここで標準入力
B = float(input()) #ここで標準入力


output = A * B
print(int(output))

Fixed submission:
from math import floor
from decimal import Decimal
a, b = input().split()
a = int(a)
b = Decimal(b)
print(floor(a * b))
Buggy python submission (verdict: Runtime Error):
N = str(input()) #ここで標準入力

car = ''
if N[-1] == 3:
    car = 'bon'
elif N[-1] == 0 or N[-1] == 1 or N[-1] == 6 or N[-1] == 8
    car = 'pon'

print(car)

Fixed submission:
N = str(input()) #ここで標準入力

car = ''
if N[-1] == '3':
    car = 'bon'
elif N[-1] == '0' or N[-1] == '1' or N[-1] == '6' or N[-1] == '8':
    car = 'pon'
else:
    car = 'hon'



print(car)

Buggy python submission (verdict: Runtime Error):
N = str(input()) #ここで標準入力

car = ''
if N[-1] == 3:
    car = 'bon'
elif N[-1] == 0 or N[-1] == 1 or N[-1] == 6 N[-1] == 8
    car = 'pon'

print(car)

Fixed submission:
N = str(input()) #ここで標準入力

car = ''
if N[-1] == '3':
    car = 'bon'
elif N[-1] == '0' or N[-1] == '1' or N[-1] == '6' or N[-1] == '8':
    car = 'pon'
else:
    car = 'hon'



print(car)
Buggy python submission (verdict: Runtime Error):
A, B, C, K = map(int,input().split())

if K - A - B > 0:
    print(1 * A - (K - A - B) * 1)

elif K - A < 0:
    print(1 * K)

else K - A - B <= 0:
    print(1 * A)



Fixed submission:
A, B, C, K = map(int,input().split())

if K - A - B > 0:
    print(1 * A - (K - A - B) * 1)

elif K - A < 0:
    print(1 * K)

elif K - A - B <= 0:
    print(1 * A)
Buggy python submission (verdict: Runtime Error):
S = input()
if S[-1] = 's':
  return S + 'es'
else:
  return S + 's'


Fixed submission:
def solution():
  S = input()
  if S[-1] == 's':
    return S + 'es'
  else:
    return S + 's'

print (solution())
Buggy python submission (verdict: Runtime Error):
input = int(input())
if input == 0: return 1
return 0

Fixed submission:
def a():
  x :int = int(input())
  if x == 1:
    return 0
  else:
    return 1

if __name__ == '__main__':
  print(a())
Buggy python submission (verdict: Runtime Error):
n = int(input())

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

n = max(a)

highest = 0
last = 0
for i in range(n):
    if a[i] >= highest:
        highest = a[i]
        last = i

shortest = highest
for j in range(0, i):
    if a[j] <= shortest:
        shortest = a[j]
        #print(shortest)

print(highest - shortest)

Fixed submission:
n = int(input())

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


highest = 0
ans = 0

for i in a:
    if i > highest:
        highest = i
    ans += highest - i

print(ans)
Buggy python submission (verdict: Runtime Error):
import math

n, k = map(int, input().split())
a = list(map(int, input().split()))

floor = 0
ceil = max(a)


def cut(long, logs):
    cnt = 0
    for i in logs:
        cnt += math.ceil(i / long) - 1
    return cnt


while ceil - floor > 1:
    L = (ceil + floor)//2
    num = cut(L, a)
    if num <= k:
        ceil = L
    else:
        floor = L

print(ceil)

Fixed submission:
n = int(input())

if n >= 30:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
n = int(input())
judge = {"AC":0, "WA":0, "TLE":0, "RE":0}
for i in range(n):
  judge[i] += 1

for j in judge:
  print(f"{j} x {judge[j]}")
  

Fixed submission:
n = int(input())
judge = {"AC": 0, "WA": 0, "TLE": 0, "RE": 0}
for _ in range(n):
    i = input()
    judge[i] += 1

for j in judge:
    print(f"{j} x {judge[j]} ")
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))
aa = [0] * (10 ** 6 + 1)
a.sort()
ans = 0


for i in a:
    for j in range(i, 10 ** 6 + 1, i):
        aa[j] += 1

a = set(a)

for k in a:
    if aa[k] == 1:
        ans += 1


print(ans)

Fixed submission:
n = int(input())
a = list(map(int, input().split()))
cnt = [0] * (10 ** 6 + 1)
a.sort()
ans = 0


for i in a:
    cnt[i] += 1

a = set(a)

for k in a:
    for l in range(k * 2, (10 ** 6 + 1), k):
        cnt[l] += 1

for m in a:
    if cnt[m] == 1:
        ans += 1
    


print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))
aa = [0] * (10 ** 6 + 1)
a.sort()
ans = 0


for i in a:
    for j in range(i, 10 ** 6 + 1, i):
        aa[j] += 1

a = set(a)

for k in a:
    if aa[k] == 1:
        ans += 1


print(ans)

Fixed submission:
n = int(input())
a = list(map(int, input().split()))
cnt = [0] * (10 ** 6 + 1)
a.sort()
ans = 0


for i in a:
    cnt[i] += 1

a = set(a)

for k in a:
    for l in range(k * 2, (10 ** 6 + 1), k):
        cnt[l] += 1

for m in a:
    if cnt[m] == 1:
        ans += 1
    


print(ans)
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input())
print(a * b)

Fixed submission:
a, b = map(int, input().split())
print(a * b)
Buggy python submission (verdict: Runtime Error):
t = list(map(str, input()))
ans = t[:]

if t[0] == "?":
    if t[1] == "P":
        ans[0] = "D"
    else:
        ans[0] = "P"

for i in range(1, len(t)-1):
    if t[i] == "?":
        if t[i - 1] == "P":
            ans[i] = "D"
        else:
            if t[i + 1] == "D" or t[i + 1] == "?":
                ans[i] = "P"
            else:
                ans[i] = "D"

if t[-1] == "?":
    ans[-1] = "D"

print("".join(ans))


Fixed submission:
t = list(map(str, input()))
ans = t[:]

if len(t) == 1:
    if t[0] == "?":
        ans[0] = "D"
else:
    if t[0] == "?":
        if t[1] == "P":
            ans[0] = "D"
        else:
            ans[0] = "P"

    for i in range(1, len(t)-1):
        if t[i] == "?":
            if ans[i - 1] == "P":
                ans[i] = "D"
            else:
                if t[i + 1] == "D" or t[i + 1] == "?":
                    ans[i] = "P"
                else:
                    ans[i] = "D"

    if t[-1] == "?":
        ans[-1] = "D"

print("".join(ans))
Buggy python submission (verdict: Runtime Error):
S = input()
if S == ABC:
  print("ARC")
else:
  print("ABC")

Fixed submission:
n = str(input())

if n == "ABC":
    print("ARC")
else:
    print("ABC")

Buggy python submission (verdict: Runtime Error):
n = int(input())
nn = int(pow(n,1/5)) + 1
p = sorted(range(nn),reverse = True)
for i in p:
    b = pow(n - i, 1/5)
    if float.is_integer(b):
        break

print(i,int(-b))

Fixed submission:
n = str(input())

if n == "ABC":
    print("ARC")
else:
    print("ABC")