Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
N,A,B = map(int,input().split())

r = ''
for i in range(10**100):
    r += "b"* A
    if len(r) >= N:
        break
    r += "r"* B
    if len(r) >= N:
        break
print(r[:N].count('b'))

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

s = 0
s = int(N / (A+B))*A
if N % (A+B) > A:
    s += A
else:
    s += N % (A+B)
print(s)

Buggy python submission (verdict: Runtime Error):
N,A,B = map(float,input().split())

r = ''
while True:
    r += "b"* int(A)
    if len(r) >= int(N):
        break
    r += "r"* int(B)
    if len(r) >= int(N):
        break
print(r[:int(N)].count('b'))

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

s = 0
s = int(N / (A+B))*A
if N % (A+B) > A:
    s += A
else:
    s += N % (A+B)
print(s)

Buggy python submission (verdict: Runtime Error):
N,A,B = map(int,input().split())

r = ''
while True:
    r += "b"*A
    if len(r) >= N:
        break
    r += "r"*B
    if len(r) >= N:
        break
print(r[:N].count('b'))

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

s = 0
s = int(N / (A+B))*A
if N % (A+B) > A:
    s += A
else:
    s += N % (A+B)
print(s)

Buggy python submission (verdict: Runtime Error):
N,A,B = map(int,input().split())

r = ''
while True:
    r += "b"*A
    r += "r"*B
    if len(r) >= N:
        break
print(r[:N].count('b'))

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

s = 0
s = int(N / (A+B))*A
if N % (A+B) > A:
    s += A
else:
    s += N % (A+B)
print(s)

Buggy python submission (verdict: Runtime Error):
N,A,B = map(int,input().split())

r = ''
while True:
    r += "b"*A
    r += "r"*B
    if len(r) >= N:
        break
print(r[:N].count('b'))

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

s = 0
s = int(N / (A+B))*A
if N % (A+B) > A:
    s += A
else:
    s += N % (A+B)
print(s)
Buggy python submission (verdict: Time Limit Exceeded):
num=int(input())
mm=[int(s) for s in input().split()]
total=sum(mm)


count=0
for j,i in enumerate(mm):
  count+=i
  if count>=total//2:
    flag=j
    break
p=0
q=sum([mm[i+1] for i in range(flag,len(mm)-1)])
while True:
  if count>q:
    q+=1
    p+=1
  else:
    break


mm.reverse()

count=0
for j,i in enumerate(mm):
  count+=i
  if count>=total//2:
    flag=j
    break
p2=0
q=sum([mm[i+1] for i in range(flag,len(mm)-1)])
while True:
  if count>q:
    q+=1
    p2+=1
  else:
    break

if p>=p2:
  print(p2)
else:
  print(p)

Fixed submission:
num=int(input())
mm=[int(s) for s in input().split()]
total=sum(mm)


count=0
for j,i in enumerate(mm):
  count+=i
  if count>=total//2:
    flag=j
    break

q=sum(mm[flag+1:])

p=count-q


mm.reverse()

count=0
for j,i in enumerate(mm):
  count+=i
  if count>=total//2:
    flag=j
    break

q=sum(mm[flag+1:])
p2=count-q

if p>=p2:
  print(p2)
else:
  print(p)
Buggy python submission (verdict: Runtime Error):
word = list(input())
num = int(input())
p = []
count = 1
for i in range(len(word)-1):
  if word[i] == word[i+1]:
    count += 1
    if i == len(word)-2:
      p.append(count)
  else:
    p.append(count)
    count = 1

point = 0
for i in p:
  point += i // 2
if word[0] == word[-1] and p[-1] % 2 == 1:
  point += 1
  
print(point * num)

Fixed submission:
word = list(input())
num = int(input())
if len(word) == 1:
  print(num//2)
else:
  p = []
  count = 1
  for i in range(len(word)-1):
    if word[i] == word[i+1]:
      count += 1
      if i == len(word)-2:
        p.append(count)
    else:
      p.append(count)
      count = 1

  point = 0
  
  for i in p:
    point += i // 2
  if len(p) == 1:
    print(p[0]*num//2)
  elif word[0] == word[-1]:
    print((p[0] + p[-1])//2 * (num-1) + p[0]//2 + p[-1]//2 + (point - p[0]//2 - p[-1]//2)*num)
  else:
    print(point * num)
Buggy python submission (verdict: Runtime Error):
num = int(input())
order = [int(s) for s in input().split()]
utility = [int(s) for s in input().split()]
add = [int(s) for s in input().split()]
point = 0
for i in range(num - 1):
  if order[i] + 1 == order[i + 1]:
    point += add[order[i]]
    
print(sum(utility) + point)

Fixed submission:
num = int(input())
order = [int(s) for s in input().split()]
utility = [int(s) for s in input().split()]
add = [int(s) for s in input().split()]
point = 0
for i in range(num - 1):
  if order[i] + 1 == order[i + 1]:
    point += add[order[i] - 1]
    
print(sum(utility) + point)
Buggy python submission (verdict: Runtime Error):
num = int(input())
box = []
for i range(num):
  box.append(1/int(input()))
print(1/sum(box))

Fixed submission:
num = int(input())
box1 = [int(s) for s in input().split()]
box = []
for i in box1:
  box.append(1/i)
print(1/sum(box))
Buggy python submission (verdict: Runtime Error):
num = int(input())
words = []
answer = 0

for i in range(num):
  words.append(sorted(list(input())))

for i in range(num):
  for j in range(num -i - 1):
    p = 0
    for k in range(10):
      if words[i][k] == words[j + 1 + i][k]:
        p += 1
      else:
        break
    if p == 10:
      answer += 1

print(answer)

Fixed submission:
nums = [int(s) for s in input().split()]
a = nums[0]
b = nums[1]

box = []
box.append(a + b)
box.append(a - b)
box.append(a * b)
print(max(box))
Buggy python submission (verdict: Runtime Error):
num = int(input())
row = [int(s) for s in input().split()]
row[0] -= 1
for i in range(num - 1):
  if row[i + 1] > row[i]:
    row[i + 1] -= 1

p = 0
for i in range(num - 1):
  if row[i] <= row[i + 1]:
    p += 1
    
if p == num - 1:
  print("Yes")
else:
  print("No")

Fixed submission:
a = input().split( )
num = int(a[2]) - (int(a[0]) - int(a[1]))

if num <= 0:
  print(0)
else:
  print(num)
Buggy python submission (verdict: Time Limit Exceeded):
words = list(input())
num = len(words)
children = [0 for s in range(num)]

for i in range(num):
  if words[i] == "R":
    a = 0
    while True:
      if words[a + i + 1] == "R":
        a += 1
      else:
        if a % 2 == 0:
          children[i + a] += 1
          break
        else:
          children[i + a + 1] += 1
          break      
  else:
    a = 0
    while True:
      if words[i - a - 1] == "L":
        a += 1
      else:
        if a % 2 == 0:
          children[i - a] += 1
          break
        else:
          children[i - a - 1] += 1
          break      
          
answer = str(children[0])
for i in range(num - 1):
  answer += " " + str(children[i+1])
print(answer)

Fixed submission:
words = list(input())
num = len(words)
children = [0 for s in range(num)]
p = 0
for i in range(num - 1):
  p += 1
  if i == num - 2:
    if words[i] == "R":
      if p % 2 == 1:
        children[i] += int(p/2) + 1
        children[i+1] += int(p/2) + 1
        p = 0
      else:
        children[i] += int(p/2)
        children[i+1] += int(p/2) + 1
        p = 0
    else:
      p += 1
      if p % 2 == 1:
        children[i-p+2] += int(p/2) + 1
        children[i-p + 1] += int(p/2)
        p = 0
      else:
        children[i+2-p] += int(p/2)
        children[i-p+1] += int(p/2)
        p = 0
  elif words[i] == words[i + 1]:
    pass
  else:
    if words[i] == "R":
      if p % 2 == 1:
        children[i] += int(p/2) + 1
        children[i+1] += int(p/2)
        p = 0
      else:
        children[i] += int(p/2)
        children[i+1] += int(p/2)
        p = 0
    else:
      if p % 2 == 1:
        children[i-p+1] += int(p/2) + 1
        children[i-p] += int(p/2)
        p = 0
      else:
        children[i+1-p] += int(p/2)
        children[i-p] += int(p/2)
        p = 0
             
answer = str(children[0])
for i in range(num - 1):
  answer += " " + str(children[i+1])
print(answer)
Buggy python submission (verdict: Time Limit Exceeded):
import fractions
import copy
from functools import reduce
num = int(input())
nums = [int(s) for s in input().split()]

def gcd_list(numbers):
    return reduce(fractions.gcd, nums)
def gcd(*numbers):
    return reduce(fractions.gcd, numbers)
answer = []
for i in range(num):
  ls = copy.deepcopy(nums)
  del ls[i]
  answer.append(gcd(*ls))
print(max(answer))

Fixed submission:
def gcd(a,b):
  if not a or not b:
    return 0
  else:
    while b:
      a,b = b,a%b
    return a

num = int(input())
nums = [int(s) for s in input().split()]

l = nums[0]
r = nums[-1]
left = []
right = []
for i in range(num-1):
  l,r = gcd(l,nums[i]), gcd(r,nums[-i-1])
  left.append(l)
  right.append(r)
answer = [left[-1],right[-1]]
for i in range(len(left)-1):
  answer.append(gcd(left[i],right[-i-2]))
print(max(answer))
Buggy python submission (verdict: Runtime Error):
n=int(input())
a = list(map(int,input().split()))
b=0
a.sort()

for i in range(n-1):
    if a[i]==a[i+1]:
        b+=1
nl=[]
while 1:
    p=a.pop(a[1])
    for i in a:
        if i%p!=0:
            nl.append(i)
    nl.append(p)
    if len(a)==len(nl):
        print(len(a)-b)
        exit()
    a=nl[::]


Fixed submission:
from collections import Counter

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

m=a[-1]+1
dp=[1]*m
c=Counter(a)
ans=0
for i in a:
    if dp[i] and c[i]==1:
        ans+=1

    for j in range(2*i, m, i):
        dp[j]=0

print(ans)
#print(c)
Buggy python submission (verdict: Runtime Error):
a,b,n=map(int,input().split())
l=[]

if n>b:
    for x in range(b-1,n):
        y=a*x//b-a*(x//b)
        l.append(y)

else:
    for x in range(1,n):
        y=a*x//b-a*(x//b)
        l.append(y)


print(max(l))


Fixed submission:
a,b,n=map(int,input().split())
l=[]
m=a//b
if b==1:
    print(0)
    exit()
if n>=b:
    for x in range(b-1,n+1,b):
        y=a*x//b-a*(x//b)
        #l.append(y)
        m=max(m,y)
    x=n
    y=a*x//b-a*(x//b)
    m=max(m,y)
else:
    x=n
    y=a*x//b-a*(x//b)
    #l.append(y)
    xx=n-1
    yy=a*xx//b-a*(xx//b)
    m=max(y,yy)


print(m)
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
a = list(map(int,input().split()))
a.sort
for i in range(1,n+1):
    print(a.count(i))


Fixed submission:
n=int(input())
a = list(map(int,input().split()))
c=[0]*n
for i in a:
    c[i-1]+=1
for j in c:
    print(j)

Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
a = list(map(int,input().split()))
a.sort
for i in range(1,n+1):
    print(a.count(i))


Fixed submission:
n=int(input())
a = list(map(int,input().split()))
c=[0]*n
for i in a:
    c[i-1]+=1
for j in c:
    print(j)
Buggy python submission (verdict: Time Limit Exceeded):
import math
from functools import reduce

def gcd(*numbers):
    return reduce(math.gcd, numbers)

def gcd_list(numbers):
    return reduce(math.gcd, numbers)

k=int(input())
ans=0
for a in range(1,k+1):
    for b in range(1,k+1):
        for c in range(1,k+1):
            ans+=gcd(a,b,c)
print(ans)


Fixed submission:
import math
from functools import reduce

def gcd(*numbers):
    return reduce(math.gcd, numbers)

def gcd_list(numbers):
    return reduce(math.gcd, numbers)

k=int(input())
ans=0
for a in range(1,k+1):
    for b in range(1,k+1):
        for c in range(1,k+1):
            ans+=gcd(a,b,c)
print(ans)
Buggy python submission (verdict: Runtime Error):
n,T=map(int,input().split())
ck=[]
times=[]
l=[]
t=0
s=0
count=0
for i in range(n):
    ck=list(map(str,input().split()))

nck=sorted(ck,reverse=True)
for i in range(n):
    for i in range(n):
        t+=1
        s=t*int(nck[i-1][0])+int(nck[i-1][1])
        t+=s
        count+=1
        if t>T:
            t-=s
            n-=1
            times.append(count)
            nck.remove(nck[0])
            break
print(max(times))


Fixed submission:
s=input()
a=[str(c) for c in s]
if len(a)%2!=0:
    print("No")
    exit()
for i in range(len(a)):
    if i%2==1:
        if a[i]!="i":
            print("No")
            exit()
    else:
        if a[i]!="h":
            print("No")
            exit()
print("Yes")
Buggy python submission (verdict: Runtime Error):
a,b,m=map(int,input().split())
ak=list(map(int,input().split()))
bk=list(map(int,input().split()))
kei=[]
for i in range(m):
    x,y,c=map(int,input().split())
    pay=[ak[x]+bk[y]-c]
    kei+=pay
print(min(kei))


Fixed submission:
a,b,m=map(int,input().split())
ak=list(map(int,input().split()))
bk=list(map(int,input().split()))
kei=[]
w=min(ak)+min(bk)
kei.append(w)
for i in range(m):
    x,y,c=map(int,input().split())
    pay=ak[x-1]+bk[y-1]-c
    kei.append(pay)
print(min(kei))

Buggy python submission (verdict: Runtime Error):
a,b,m=map(int,input().sprit())
ak=list(map(int,input().split()))
bk=list(map(int,input().split()))
kei=[]
for i in range(m):
    x,y,c=map(int,input().split())
    pay=ak[x]+bk[y]-c
    kei+=pay
print(mim(kei))


Fixed submission:
a,b,m=map(int,input().split())
ak=list(map(int,input().split()))
bk=list(map(int,input().split()))
kei=[]
w=min(ak)+min(bk)
kei.append(w)
for i in range(m):
    x,y,c=map(int,input().split())
    pay=ak[x-1]+bk[y-1]-c
    kei.append(pay)
print(min(kei))

Buggy python submission (verdict: Runtime Error):
a,b,m=map(int,input().sprit())
ak=list(map(int,input().split()))
bk=list(map(int,input().split()))
kei=[]
for i in range(m):
    x,y,c=map(int,input().split())
    pay=ak[x]+bk[y]-c
    kei+=pay
print(mim(kei))


Fixed submission:
a,b,m=map(int,input().split())
ak=list(map(int,input().split()))
bk=list(map(int,input().split()))
kei=[]
w=min(ak)+min(bk)
kei.append(w)
for i in range(m):
    x,y,c=map(int,input().split())
    pay=ak[x-1]+bk[y-1]-c
    kei.append(pay)
print(min(kei))
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
a=list(map(int,input().split()))
count=0
f=True
while f:
    b=0
    for i in range(n):
        if a[i]%2==0:
            count+=1
            a[i]/=2
            for j in range(n):
                if a[j]%2==0:
                    b+=1

            if b==0:
                print(count)
                exit()


Fixed submission:
n=int(input())
a=list(map(int,input().split()))
count=0
f=True
while f:
    b=0
    for i in range(n):
        if a[i]%2==0:
            count+=1
            a[i]/=2

            if a[i]%2==0:
                b+=1

    if b==0:
        print(count)
        exit()
Buggy python submission (verdict: Runtime Error):
import sys
n,w=map(int,input().split())
st=[[str(a) for s in b.strip()] for b in sys.stdin]
count=0
for i in range(1,n-2):
    for j in range(1,w-2):
        if st[i][j]=="#":
            count+=1
            if st[i][j]!=st[i-1][j] and st[i][j]!=st[i][j-1] and st[i][j+1]!=st[i][j] and st[i][j]!=st[i+1][j]:
                print("No")
                exit()
if st[0][0]=="#" and st[0][0]!=st[0][1] and st[1][0]!=st[0][0]:
    print("No")
    exit()

if st[0][w-1]=="#" and st[0][0]!=st[0][w-2] and st[1][w-1]!=st[0][w-1]:
    print("No")
    exit()

if st[n-1][w-1]=="#" and st[n-1][w-1]!=st[n-1][w-2] and st[n-1][w-1]!=st[n-2][w-1]:
    print("No")
    exit()
if st[n-1][0]=="#" and st[n-1][0]!=st[n-1][1] and st[n-2][0]!=st[n-1][0]:
    print("No")
    exit()
print("Yes")


Fixed submission:
n,w=map(int,input().split())
st=[]
for i in range(n):
    st.append(list(input())) #0~n-1までの列ができる
if n==w==1:
    print("Yes")
    exit()

for i in range(1,n-1):
    for j in range(1,w-1): #i,jに1足しても引いても範囲内だから安心！
        if st[i][j]=="#":
            if st[i+1][j]=="." and st[i][j-1]=="." and st[i][j+1]=="." and st[i-1][j]==".":
                print("No")
                exit()
        

print("Yes")

Buggy python submission (verdict: Runtime Error):
import sys
n,w=map(int,input().split())
st=[[a for s in b.strip()] for b in sys.stdin]
count=0
for i in range(1,n-2):
    for j in range(1,w-2):
        if st[i][j]=="#":
            count+=1
            if st[i][j]!=st[i-1][j] and st[i][j]!=st[i][j-1] and st[i][j+1]!=st[i][j] and st[i][j]!=st[i+1][j]:
                print("No")
                exit()
if st[0][0]=="#" and st[0][0]!=st[0][1] and st[1][0]!=st[0][0]:
    print("No")
    exit()

if st[0][w-1]=="#" and st[0][0]!=st[0][w-2] and st[1][w-1]!=st[0][w-1]:
    print("No")
    exit()

if st[n-1][w-1]=="#" and st[n-1][w-1]!=st[n-1][w-2] and st[n-1][w-1]!=st[n-2][w-1]:
    print("No")
    exit()
if st[n-1][0]=="#" and st[n-1][0]!=st[n-1][1] and st[n-2][0]!=st[n-1][0]:
    print("No")
    exit()
print("Yes")


Fixed submission:
n,w=map(int,input().split())
st=[]
for i in range(n):
    st.append(list(input())) #0~n-1までの列ができる
if n==w==1:
    print("Yes")
    exit()

for i in range(1,n-1):
    for j in range(1,w-1): #i,jに1足しても引いても範囲内だから安心！
        if st[i][j]=="#":
            if st[i+1][j]=="." and st[i][j-1]=="." and st[i][j+1]=="." and st[i-1][j]==".":
                print("No")
                exit()
        

print("Yes")
Buggy python submission (verdict: Runtime Error):
import sys

N = int(input())
nums = list(map(int, input().split(' ')))

output = 1

if 0 in nums:
  print(0)
  sys.exit()
  
else:
  for x in nums:
    output *= x

    if output > 10**18:
      print(-1)
      sys.exit()

  print(output)

Fixed submission:
N, M = input().split(' ')
N, M = int(N), int(M)

print(N*M)

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

N = int(input())
nums = list(map(int, input().split(' ')))

output = 1

if 0 in nums:
  print(0)
  sys.exit()
  
else:
  for x in nums:
    output *= x

    if output > 10**18:
      print('-1')
      sys.exit()

  print(output)

Fixed submission:
N, M = input().split(' ')
N, M = int(N), int(M)

print(N*M)

Buggy python submission (verdict: Runtime Error):
N = int(input())
M = int(input())

print(N*M)

Fixed submission:
N, M = input().split(' ')
N, M = int(N), int(M)

print(N*M)
Buggy python submission (verdict: Runtime Error):
import sys

N = int(input())
nums = list(map(int, input().split(' ')))

output = 1

if 0 in nums:
  print(0)
  
else:
  for x in nums:
    output *= x

    if output > 10**18
      print('-1')
      sys.exit()

  print(output)

Fixed submission:
import sys

N = int(input())
nums = list(map(int, input().split(' ')))

output = 1

if 0 in nums:
  print(0)
  sys.exit()
  
else:
  for x in nums:
    output *= x

    if output > 10**18:
      print(-1)
      sys.exit()

  print(output)

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

N = int(input())
nums = list(map(int, input().split(' ')))

output = 1

if 0 in nums:
  print(0)
  sys.exit()
  
else:
  for x in nums:
    output *= x

    if output > 10**18:s
      print('-1')
      sys.exit()

  print(output)

Fixed submission:
import sys

N = int(input())
nums = list(map(int, input().split(' ')))

output = 1

if 0 in nums:
  print(0)
  sys.exit()
  
else:
  for x in nums:
    output *= x

    if output > 10**18:
      print(-1)
      sys.exit()

  print(output)
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())

if a*b%==0:
  print("Even")
else:
  print("Odd")

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

N=a*b

if N%2==0:
  print("Even")
else:
  print("Odd")

Buggy python submission (verdict: Runtime Error):
N=int(input())
x=[0]
y=[0]
t=[0]

flag=1
for i in range(1,N+1):
  t_tmp,x_tmp,y_tmp=map(int,input().split())
  t.append(t_tmp)
  x.append(x_tmp)
  y.append(y_tmp)
  time=abs(t[i-1]-t[i])
  d=abs(x[i-1]-x[i])+abs(y[i-1]-y[i])
  if d>time or (d%2)!=(time%2):
    print("No")
    flag=0
    break
    
if flag==1:
  print("Yes")

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

N=a*b

if N%2==0:
  print("Even")
else:
  print("Odd")

Buggy python submission (verdict: Runtime Error):
N=int(input())
x=[0]
y=[0]

flag=1
for i in range(1,N+1):
  t,x_tmp,y_tmp=map(int,input().split())
  x.append(x_tmp)
  y.append(y_tmp)
  d=abs(x[i-1]-x[i])+abs(y[i-1]-y[i])
  if d>t or (d%2)!=(t%2):
    print("No")
    flag=0
    break
    
if flag==1:
  print("Yes")

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

N=a*b

if N%2==0:
  print("Even")
else:
  print("Odd")

Buggy python submission (verdict: Runtime Error):
N=int(input())
x=[0]
y=[0]

for i in range(1,N):
  t,x_tmp,y_tmp=map(int,input().split())
  x.append(x_tmp)
  y.append(y_tmp)
  d=abs(x[i-1]-x[i])+abs(y[i-1]-y[i])
  if d>t or d%2!=t%2:
    print("No")
    flag=0
    break
  else:
    flag=1
    
if flag==1:
  print("Yes")

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

N=a*b

if N%2==0:
  print("Even")
else:
  print("Odd")
Buggy python submission (verdict: Runtime Error):
a,b=input().split()
N=int(a+b)

for i in range(N):
  s=N//i
  if N%i==0 and s==i:
    pritn("Yes")
  else:
    print("No")

Fixed submission:
a,b=input().split()
N=int(a+b)
 
flag=1
for i in range(1,N):
  s=N//i
  if N%i==0 and s==i:
    print("Yes")
    flag=0
    break
if flag==1:
  print("No")
Buggy python submission (verdict: Time Limit Exceeded):
N,Y=list(map(int,input().split()))

flg=1               #N枚のお札の合計金額がY円となることがありえない場合
for i in range(N+1):
    for j in range(N-i+1):
        for k in range(N-i-j+1):
            if i+j+k==N and 10000*i+5000*j+1000*k==Y:
                flg=0
                x=i
                y=j
                z=k
if flg==1:
    print('-1 -1 -1')
else:
    print(x,end=" ")
    print(y,end=" ")
    print(z)



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

flg=1               #N枚のお札の合計金額がY円となることがありえない場合
for i in range(N+1):
    for j in range(N-i+1):
        k=N-(i+j)
        if 10000*i+5000*j+1000*k==Y:
            flg=0
            x=i
            y=j
            z=k
if flg==1:
    print('-1 -1 -1')
else:
    print(x,end=" ")
    print(y,end=" ")
    print(z)
Buggy python submission (verdict: Runtime Error):
N=int(input())
A=list(map(int,input().split()))
 
flg=1
count=0
while True:
    for i in A: #全て偶数か確かめる
        if i%2==1:
            flg=0
            break

    if flg==1:
        for i in A:
            i=i//2
        count+=1
    else:
        break
print(count)

Fixed submission:
input_line=input()
s=list(map(int,input_line))
print(sum(s))
Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
A=list(map(int,input().split()))
 
flg=1
count=0
while True:
    for i in A: #全て偶数か確かめる
        if i%2==1:
            break
        
    if flg==1:
        for i in A:
            i=i//2
        count+=1
    else:
        break
print(count)

Fixed submission:
N=int(input())
A=list(map(int,input().split()))
 
flg=1
count=0
while True:
    for i in A: #全て偶数か確かめる
        if i%2==1:
            flg=0
            break

    if flg==1:
        for i in range(N):
            A[i]=A[i]//2
        count+=1
    else:
        break
print(count)

Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
A=list(map(int,input().split()))

flg=1
count=0
while True:
    for i in A: #全て偶数か確かめる
        if i%2==1:
            break
    if flg==1:
        for i in A:
            i=i//2
        count+=1
    else:
        break
print(count)


Fixed submission:
N=int(input())
A=list(map(int,input().split()))
 
flg=1
count=0
while True:
    for i in A: #全て偶数か確かめる
        if i%2==1:
            flg=0
            break

    if flg==1:
        for i in range(N):
            A[i]=A[i]//2
        count+=1
    else:
        break
print(count)

Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
A=list(map(int,input().split()))
flg=1
count=0
while(0==0):
    for i in A: #全て偶数か確かめる
        if i%2!=0:
            flg=0
            break
    if flg==1:
        for i in A:
            i=i%2
        count+=1
    else:
        break
print(count)


Fixed submission:
N=int(input())
A=list(map(int,input().split()))
 
flg=1
count=0
while True:
    for i in A: #全て偶数か確かめる
        if i%2==1:
            flg=0
            break

    if flg==1:
        for i in range(N):
            A[i]=A[i]//2
        count+=1
    else:
        break
print(count)

Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
A=list(map(int,input().split()))
flg=1
count=0
while(0==0):
    for i in A:
        if i%2!=0:
            flg=0
    if flg==1:
        for i in A:
            i=i%2
        count+=1
    else:
        break
print(count)


Fixed submission:
N=int(input())
A=list(map(int,input().split()))
 
flg=1
count=0
while True:
    for i in A: #全て偶数か確かめる
        if i%2==1:
            flg=0
            break

    if flg==1:
        for i in range(N):
            A[i]=A[i]//2
        count+=1
    else:
        break
print(count)