Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
a,b,c = map(int,input.split())
print (min(b//a,c))

Fixed submission:
input = input()
a,b,c = map(int,input.split())
print (min(b//a,c))

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

print (a)
print (b)
print (c)

Fixed submission:
input = input()
a,b,c = map(int,input.split())
print (min(b//a,c))
Buggy python submission (verdict: Runtime Error):
a,b = map(in(),input().split())
if(b%2 == 0):
  print(a+b)
else:
  print(b-a)

Fixed submission:
a,b = map(int,input().split())
if(b%a == 0):
  print(a+b)
else:
  print(b-a)
Buggy python submission (verdict: Runtime Error):
x,t = map(int,input.().split())
print(x/t)

Fixed submission:
x,t = map(int,input().split())
print(x/t)
Buggy python submission (verdict: Runtime Error):
size = int(input())
sides = []
for _ in range(len):
  sides.append(int(input()))
big = max(sides)
together = sum(sides)
if(big < together):
  print("Yes")
else:
  print("No")

Fixed submission:
size = int(input())
sides = input().split()
ss = []
for x in sides:
  ss.append(int(x))
big = max(ss)
together = sum(ss)
if(big < together-big):
	print("Yes")
else:
	print("No")
Buggy python submission (verdict: Runtime Error):
    i = int(input())
    seen = set()
    seen.add(i)
    temp = i
    for x in range(0,1000000):
      if(temp%2 == 0):
        temp = temp/2
      else:
        temp = 3*temp+1
      if(temp in seen):
        print(x)
        break
      else:
        seen.add(temp)

Fixed submission:
i = int(input())
seen = set()
seen.add(i)
temp = i
for x in range(2,1000000):
    if(temp%2 == 0):
        temp = temp/2
    else:
        temp = 3*temp+1
    if(temp in seen):
        print(x)
        break
    else:
        seen.add(temp)

Buggy python submission (verdict: Runtime Error):
i = int(input())
seen = set()
seen.add(i)
temp = i
for x in range(0,1000000):
  if(temp%2 == 0):
    temp = temp/2
  else:
    temp = 3temp+1
  if(temp in seen):
    print(x)
    break
  else:
    seen.add(temp)

Fixed submission:
i = int(input())
seen = set()
seen.add(i)
temp = i
for x in range(2,1000000):
    if(temp%2 == 0):
        temp = temp/2
    else:
        temp = 3*temp+1
    if(temp in seen):
        print(x)
        break
    else:
        seen.add(temp)

Buggy python submission (verdict: Runtime Error):
i = int(input())
seen = set()
seen.add(i)
temp = i
for x in rannge(0,1000000):
  if(temp%2 == 0):
    temp = temp/2
  else:
    temp = 3temp+1
  if(temp in seen):
    print(x)
    break
  else:
    seen.add(temp)

Fixed submission:
i = int(input())
seen = set()
seen.add(i)
temp = i
for x in range(2,1000000):
    if(temp%2 == 0):
        temp = temp/2
    else:
        temp = 3*temp+1
    if(temp in seen):
        print(x)
        break
    else:
        seen.add(temp)

Buggy python submission (verdict: Runtime Error):
i = int(input())
seen = set()
seen.add(i)
temp = i
for x in rannge(0,1000000):
  if(temp%2 == 0):
    temp = temp/2
  else:
    temp = 3temp+1
  if(temp in seen):
    print(x)
    break
  

Fixed submission:
i = int(input())
seen = set()
seen.add(i)
temp = i
for x in range(2,1000000):
    if(temp%2 == 0):
        temp = temp/2
    else:
        temp = 3*temp+1
    if(temp in seen):
        print(x)
        break
    else:
        seen.add(temp)
Buggy python submission (verdict: Runtime Error):
input = int(input)
if(input == 22):
  print("Christmas Eve Eve Eve")
elif(input == 23):
  print("Christmas Eve Eve")
elif(input == 24):
  print("Christmas Eve")
elif(input == 25):
  print("Christmas")


Fixed submission:
input = int(input())
if(input == 22):
  print("Christmas Eve Eve Eve")
elif(input == 23):
  print("Christmas Eve Eve")
elif(input == 24):
  print("Christmas Eve")
elif(input == 25):
  print("Christmas")
Buggy python submission (verdict: Runtime Error):
tb, x = input().split()
ta = tb/x
print(ta)

Fixed submission:
tb, x = input().split()
ta = int(tb)/int(x)
print(ta)
Buggy python submission (verdict: Runtime Error):
import sys

args = []

args.append(int(input()))
args.append(int(input()))
args.append(int(input()))

result = int(args[1] / args[0])
if result > args[2]:
    result = args[2]
print(result)


Fixed submission:
import sys


args = str(input()).split(" ")

result = int(int(args[1]) / int(args[0]))
if result > int(args[2]):
    result = int(args[2])
print(result)

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

args = []
args[0] = int(input())
args[1] = int(input())
args[2] = int(input())

result = int(args[1]) / args[0])
if result > args[2]:
    result = args[2]
print(result)


Fixed submission:
import sys


args = str(input()).split(" ")

result = int(int(args[1]) / int(args[0]))
if result > int(args[2]):
    result = int(args[2])
print(result)

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

args = sys.argv

result = int(int(args[2]) / int(args[1]))
if result > int(args[3]):
    result = int(args[3])
print(result)


Fixed submission:
import sys


args = str(input()).split(" ")

result = int(int(args[1]) / int(args[0]))
if result > int(args[2]):
    result = int(args[2])
print(result)

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

args = sys.argv

result = int(int(args[2]) / int(args[1]))
if result > int(args[3]):
    result = int(args[3])
print(result)


Fixed submission:
import sys


args = str(input()).split(" ")

result = int(int(args[1]) / int(args[0]))
if result > int(args[2]):
    result = int(args[2])
print(result)
Buggy python submission (verdict: Runtime Error):
n = int(input())

xyh = []
for i in range(n):
    xyh.append(list(map(int, input().split())))

ans = []
for cx in range(101): #Cx 0~100
    for cy in range(101): #Cy 0~100
        h = []
        for i in range(n):
            #x[i], y[i], h[i]のときの高さHを求める
            #H = |x[i] - Cx| + |y[i] - Cy| + h[i]
            h.append(abs(xyh[i][0] - cx) + abs(xyh[i][1] - cy) + xyh[i][2])

        # Hがすべて一致するときのCx, Cyが答えである
        if len(set(h)) == 1:
            ans.append(cx)
            ans.append(cy)
            ans.append(h[0])

print(ans[0], ans[1], ans[2])


Fixed submission:
from collections import Counter

n = int(input())

xyh = []
for i in range(n):
    xyh.append(list(map(int, input().split())))

for i in range(n): # 高さが0でない情報を探す
    if xyh[i][2] != 0:
        xyh_1 = xyh[i]
        break

for cx in range(101): #Cx 0~100
    for cy in range(101): #Cy 0~100
        h = abs(xyh_1[0] - cx) + abs(xyh_1[1] - cy) + xyh_1[2] # 高さHを求める

        flag = 0
        for i in range(n):
             # 高さHが適切であるか確認
            if xyh[i][2] == max(h - abs(xyh[i][0] - cx) - abs(xyh[i][1] - cy), 0):
                flag += 1

        if flag == n:
            print(cx, cy, h)
Buggy python submission (verdict: Runtime Error):
import math
import functools

n, x = map(int, input().split())

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

l = []
for i in range(n):
    l.append(abs(xi[i] - x))

ans = functools.reduce(math.gcd, l)

print(ans)


Fixed submission:
import fractions
import functools

n, x = map(int, input().split())

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

l = []
for i in range(n):
    l.append(abs(xi[i] - x))

ans = functools.reduce(fractions.gcd, l)

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

    h = 0
    for i in range(1, 1000):
        h += i

        if (h - old_h) == (b - a):
            print(h - b)
            exit()

        old_h = h

if __name__ == "__main__":
    main()


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

    h = 0
    ans = 0
    for i in range(1, 1000):
        h += i

        if h > b:
            b_h = h - b
            if a_h == b_h:
                ans = b_h
                break
        if h > a:
            a_h = h - a

    print(ans)


if __name__ == "__main__":
    main()

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

    h = b - a

    i, ans = 0
    while True:
        i += 1
        ans += i

        if h == i:
            break

    print(ans)


if __name__ == "__main__":
    main()


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

    h = 0
    ans = 0
    for i in range(1, 1000):
        h += i

        if h > b:
            b_h = h - b
            if a_h == b_h:
                ans = b_h
                break
        if h > a:
            a_h = h - a

    print(ans)


if __name__ == "__main__":
    main()
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = [int(i) for i in input().split()]

b = []
for n in a:
    if n % 2 == 0:
        b.append(n)

cnt = 0

while any(n % 2 == 0 for n in b):
    b = sorted(b)
    cnt += 1
    for i in range(len(b)):
        if i == len(b)-1:
            b[i] = b[i]/2
        else:
            b[i] = b[i]*3

    b = [n for n in b if n%2 == 0]

print(cnt)

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

b = [n for n in a if n%2 == 0]

cnt = 0
for n in b:
    while n % 2 != 1:
        n = n/2
        cnt += 1

print(cnt)
Buggy python submission (verdict: Time Limit Exceeded):
from collections import Counter
n = int(input())
s = input()
m = 10000000000000000
for i in range(0, n):
    a = s[:i]
    b = s[i+1:]
    cnt = Counter(a)['W'] + Counter(b)['E']
    m = min(m, cnt)

print(m)


Fixed submission:
n = int(input())
s = input()
m = n

w = [s[0].count('W')]
e = [s[0].count('E')]

for i in range(1, n):
    if s[i] == 'W':
        w.append(w[i-1]+1)
        e.append(e[i-1])
    else:
        w.append(w[i-1])
        e.append(e[i-1]+1) 

for i in range(n):
    if i > 0:
        cnt = w[i-1] + e[-1] - e[i]
    else:
        cnt = e[-1] - e[0]
    m = min(cnt, m)
print(m)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
s = input()
m = 10000000000000000
for i in range(0, n):
    a = s[:i]
    # print(a)
    b = s[i+1:]
    # print(b)
    cnt = a.count('W') + b.count('E')
    # print(cnt)
    m = min(m, cnt)

print(m)


Fixed submission:
n = int(input())
s = input()
m = n

w = [s[0].count('W')]
e = [s[0].count('E')]

for i in range(1, n):
    if s[i] == 'W':
        w.append(w[i-1]+1)
        e.append(e[i-1])
    else:
        w.append(w[i-1])
        e.append(e[i-1]+1) 

for i in range(n):
    if i > 0:
        cnt = w[i-1] + e[-1] - e[i]
    else:
        cnt = e[-1] - e[0]
    m = min(cnt, m)
print(m)
Buggy python submission (verdict: Time Limit Exceeded):
n, k = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
set_a = set(a)

count_list = []
if len(set_a) <= k:
    print(0)
else:
    for num in set_a:
        count_list.append(a.count(num))
    count_list = sorted(count_list, reverse = True)

    print(sum(count_list[k:]))

Fixed submission:
from collections import Counter

n, k = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
set_a = set(a)

count_list = []
if len(set_a) <= k:
    print(0)
else:
    a = Counter(a)
    cost = 0
    for (v, c) in a.most_common()[k:]:
        cost += c
    print(cost)
Buggy python submission (verdict: Runtime Error):
import math
def lcm(x, y):
    return (x*y) // math.gcd(x, y)


    
n = int(input())
t = []
for i in range(n):
    t.append(int(input()))
b = 1
for i in range(1, len(t)):
    
    b = lcm(t[i-1],t[i])

print(b)


Fixed submission:
def gcd (a, b):
    if a < b:
        a, b = b, a
    
    if b == 0:
        return a
    return gcd(b, a % b)

def lcm (a, b):
    return a * b // gcd(a, b)

n = int(input())
t = []
for i in range(n):
    t.append(int(input()))

b = 1
for i in range(n):
    b = lcm(b, t[i])

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

coin_sound_cnt = B//A
if coin_sound_cnt > C:
  return C
else:
  return coin_sound_cnt


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

coin_sound_cnt = B//A
if coin_sound_cnt > C:
  print(C)
else:
  print(coin_sound_cnt)

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

coin_sound_cnt = B//A
if coin_sound_cnt > C:
  return C
else:
  return coin_sound_cnt

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

coin_sound_cnt = B//A
if coin_sound_cnt > C:
  print(C)
else:
  print(coin_sound_cnt)
Buggy python submission (verdict: Runtime Error):
string = str(input())
zero = 0
one = 0
for char in string:
    if char == list(chars)[0]:
        zero += 1
    else:
        one += 1

if zero == 0 or one == 0:
    print(0)
else:
    print(min(zero, one) * 2)

Fixed submission:
string = str(input())
zero = 0
one = 0
chars = set(string)
for char in string:
    if char == list(chars)[0]:
        zero += 1
    else:
        one += 1

if zero == 0 or one == 0:
    print(0)
else:
    print(min(zero, one) * 2)

Buggy python submission (verdict: Runtime Error):
string = str(input())

def take_zero_one(target, cnt=0):
    if len(target) <= 1:
        return (target, cnt)
    elif len(set(target)) == 1:
        return (target, cnt)

    prev = target[0]
    idx = 1
    while idx < len(target):
        if prev != target[idx]:
            cnt += 2
            remaining = target[:idx-1] + target[idx+1:]
            break

        prev = target[idx]
        idx += 1

    remaining, cnt = take_zero_one(remaining, cnt)

    return (remaining, cnt)

_, cnt = take_zero_one(string)
print(cnt)

Fixed submission:
string = str(input())
zero = 0
one = 0
chars = set(string)
for char in string:
    if char == list(chars)[0]:
        zero += 1
    else:
        one += 1

if zero == 0 or one == 0:
    print(0)
else:
    print(min(zero, one) * 2)

Buggy python submission (verdict: Runtime Error):
string = input()

def take_zero_one(target, cnt=0):
    if len(target) <= 1:
        return (target, cnt)
    elif len(set(target)) == 1:
        return (target, cnt)

    prev = target[0]
    idx = 1
    while idx < len(target):
        if prev != target[idx]:
            cnt += 2
            remaining = target[:idx-1] + target[idx+1:]
            break

        prev = target[idx]
        idx += 1

    remaining, cnt = take_zero_one(remaining, cnt)

    return (remaining, cnt)

_, cnt = take_zero_one(string)
print(cnt)

Fixed submission:
string = str(input())
zero = 0
one = 0
chars = set(string)
for char in string:
    if char == list(chars)[0]:
        zero += 1
    else:
        one += 1

if zero == 0 or one == 0:
    print(0)
else:
    print(min(zero, one) * 2)
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
print(max(a+b, a-b, a*b))

Fixed submission:
a, b = map(int, input().split())
print(max(a+b, a-b, a*b))
Buggy python submission (verdict: Runtime Error):
n = int(input())
s = input()

max_diff = 0
for i in range(1, len(s)):
  s1 = s[:i]
  s2 = s[i:]
  diff = len(set(s1) & set(s2))
  if diff > max_diff:
    max_diff = diff
print max_diff

Fixed submission:
n = int(input())
s = input()

max_diff = 0
for i in range(1, len(s)):
  s1 = s[:i]
  s2 = s[i:]
  diff = len(set(s1) & set(s2))
  if diff > max_diff:
    max_diff = diff
print(max_diff)
Buggy python submission (verdict: Time Limit Exceeded):
S = input()
subS = S
cnt = 0
while True:
    flg = True
    if "01" in subS:
        flg = False
        subS = subS.replace("01", "", 1)
        cnt += 2
    if "10" in subS:
        flg = False
        subS = subS.replace("10", "", 1)
        cnt += 2
    if flg:
        break
print(cnt)


Fixed submission:
S = input()

zeroSum = 0
oneSum = 0
for _ in S:
  if _ == "0":
    zeroSum += 1
  if _ == "1":
    oneSum += 1

t = max(zeroSum, oneSum) - min(zeroSum, oneSum)
print(len(S) - t)
Buggy python submission (verdict: Runtime Error):
class Solution:
  def solve(self, A, B, C):
    count = 0
    spent = 0
    while B >= 0:
      B -= A
      count += 1
      if count == C:
        return C
    return count

def main():
  A = int(input())
  B = int(input())
  C = int(input())
  print(Solution().solve(A, B, C))
        
if __name__ == "__main__":
   main()

Fixed submission:
class Solution:
  def solve(self, A, B, C):
    count = 0
    while True:
      B -= A
      if B < 0: break
      count += 1
      if count == C: return C
    return count

def main():
  inputs = list(map(int, input().split()))
  A, B, C = inputs
  print(Solution().solve(A, B, C))
        
if __name__ == "__main__":
   main()

Buggy python submission (verdict: Runtime Error):
A = int(input())
B = int(input())
C = int(input())

if A/B >= C:
  print(C)
else:
  print(A/B)


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

if B/A >= C:
  print(C)
else:
  print(B//A)
Buggy python submission (verdict: Runtime Error):
A, B, K = map(int, input().split())
max = 0
if A > B:
  max = A
else:
  max = B
divideCount = 0

for i in range(1, max):
  if A % i == 0 and B % i == 0:
    if divideCount == K:
      print(i)
      return
    else:
      divideCount += 1


Fixed submission:
A, B, K = map(int, input().split())
divideCount = 0
answer = 0

for i in range(100, 0, -1):
  if A % i == 0 and B % i == 0:
    divideCount += 1
    if divideCount == K:
      answer = i

print(answer)

Buggy python submission (verdict: Runtime Error):
A, B, K = map(int, input().split())
max = max([A, B])
divideCount = 0

for i in range(1, max):
  if A % i == 0 and B % i == 0:
    if divideCount == K:
      print(i)
      return
    else:
      divideCount += 1


Fixed submission:
A, B, K = map(int, input().split())
divideCount = 0
answer = 0

for i in range(100, 0, -1):
  if A % i == 0 and B % i == 0:
    divideCount += 1
    if divideCount == K:
      answer = i

print(answer)

Buggy python submission (verdict: Runtime Error):
A, B, K = map(int, input().split())
max = max([A, B])
divideCount = 0

for i in range(1, max):
  if A % i == 0 && B % i == 0:
    if divideCount == K:
      print(i)
      return
    else:
      divideCount += 1


Fixed submission:
A, B, K = map(int, input().split())
divideCount = 0
answer = 0

for i in range(100, 0, -1):
  if A % i == 0 and B % i == 0:
    divideCount += 1
    if divideCount == K:
      answer = i

print(answer)
Buggy python submission (verdict: Runtime Error):
n = input()
list = list(map(int, input().split()))

count = 0
can = True
while can:
  for i in range(0, n):
    a = list[i]
    if a % 2 == 0:
      list[i] = a / 2
    else:
      can = False
  if can == True:
    count += 1
print(count)

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

count = 0
can = True
while can:
  for i in range(0, int(n)):
    a = list[i]
    if a % 2 == 0:
      list[i] = a / 2
    else:
      can = False
  if can == True:
    count += 1
print(count)

Buggy python submission (verdict: Runtime Error):
n = input()
list = list(map(int, input().split()))

count = 0
can = True
while can:
  for i in range(0, 6):
    a = list[i]
    if a % 2 == 0:
      list[i] = a / 2
    else:
      can = False
  if can == True:
    count += 1
print(count)

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

count = 0
can = True
while can:
  for i in range(0, int(n)):
    a = list[i]
    if a % 2 == 0:
      list[i] = a / 2
    else:
      can = False
  if can == True:
    count += 1
print(count)

Buggy python submission (verdict: Runtime Error):
n = input()
list = input().split()

count = 0
can = True
while can:
  for i in range(0, 6):
    a = int(list[i])
    if a % 2 == 0:
      list[i] = a / 2
    else:
      can = False
  if can == True:
    count += 1
print(count)

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

count = 0
can = True
while can:
  for i in range(0, int(n)):
    a = list[i]
    if a % 2 == 0:
      list[i] = a / 2
    else:
      can = False
  if can == True:
    count += 1
print(count)
Buggy python submission (verdict: Runtime Error):
temp = []
a,b,k = map(int,input().split())
for i in range (1, min(a,b)):
  if a%i==0 and b%i==0:
    temp.append(i)
print(temp[-k])

Fixed submission:
temp = []
a,b,k = map(int,input().split())
for i in range (1, min(a,b)+1):
  if a%i==0 and b%i==0:
    temp.append(i)
print(temp[-k])

Buggy python submission (verdict: Runtime Error):
temp = []
a,b,k = map(int,input().split())
for i in range (1, min(a,b)):
  if a%i==0 and b%i==0:
    temp.append(i)
print(temp[k-1])


Fixed submission:
temp = []
a,b,k = map(int,input().split())
for i in range (1, min(a,b)+1):
  if a%i==0 and b%i==0:
    temp.append(i)
print(temp[-k])

Buggy python submission (verdict: Runtime Error):
temp = []
a,b,k = map(int,input().split())
for i in range (1, min(a,b)):
  if a%i==0 and b%i==0:
	temp.append(i)
print(temp[k])

Fixed submission:
temp = []
a,b,k = map(int,input().split())
for i in range (1, min(a,b)+1):
  if a%i==0 and b%i==0:
    temp.append(i)
print(temp[-k])

Buggy python submission (verdict: Runtime Error):
a,b,k = map(int,input().split())
c=1
d=0
while d<k:
  if a%c==0 and b%c==0:
	d+=1
  else:
	c+=1
print(c)

Fixed submission:
temp = []
a,b,k = map(int,input().split())
for i in range (1, min(a,b)+1):
  if a%i==0 and b%i==0:
    temp.append(i)
print(temp[-k])

Buggy python submission (verdict: Runtime Error):
a,b,k = map(int,input().split())
c=1
d=0
while d<k:
  if a%c==0 and b%c==0:
	d+=1
  else
	c+=1
print(c)

Fixed submission:
temp = []
a,b,k = map(int,input().split())
for i in range (1, min(a,b)+1):
  if a%i==0 and b%i==0:
    temp.append(i)
print(temp[-k])

Buggy python submission (verdict: Runtime Error):
a,b,k = map(int,input().split())
c=2
d=0
while d<k:
  if a%c==0 and b%c==0:
	d+=1
  else
	c+=1
print(d)

Fixed submission:
temp = []
a,b,k = map(int,input().split())
for i in range (1, min(a,b)+1):
  if a%i==0 and b%i==0:
    temp.append(i)
print(temp[-k])
Buggy python submission (verdict: Runtime Error):
N = int(input())
L = [int(input()) for L in range(N)]
if max(L) < (sum(L) - max(L)):
    print('Yes')
else:
    print('No')

Fixed submission:
N = int(input())
L = list(map(int,input().split()))
if max(L) < (sum(L) - max(L)):
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
N = int(input())
L = [int(input()) for L in range(N-1)]
if max(L) < (sum(L) - max(L)):
    print('Yes')
else:
    print('No')

Fixed submission:
N = int(input())
L = list(map(int,input().split()))
if max(L) < (sum(L) - max(L)):
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
N = int(input())
L = [int(input()) for L in range(N)]
if max(L) < sum(L) - max(L):
    print('Yes')
else:
    print('No')

Fixed submission:
N = int(input())
L = list(map(int,input().split()))
if max(L) < (sum(L) - max(L)):
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
N = int(input())
L = [int(input()) for i in range(N)]
if max(L) < sum(L) - max(L):
    print('Yes')
else:
    print('No')

Fixed submission:
N = int(input())
L = list(map(int,input().split()))
if max(L) < (sum(L) - max(L)):
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
N = int(input())
L = [int(input()) for i in range(N-1)]
if max(L) < sum(L) - max(L):
    print('Yes')
else:
    print('No')

Fixed submission:
N = int(input())
L = list(map(int,input().split()))
if max(L) < (sum(L) - max(L)):
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
N = int(input())
L = [int(input()) for i in range(N)]
if max(i) < sum(i) - max(i):
    print('Yes')
else:
    print('No')

Fixed submission:
N = int(input())
L = list(map(int,input().split()))
if max(L) < (sum(L) - max(L)):
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
N = int(input())
L = [for i in range(N-1)]
if max(i) < sum(i) - max(i):
    print('Yes')
else:
    print('No')

Fixed submission:
N = int(input())
L = list(map(int,input().split()))
if max(L) < (sum(L) - max(L)):
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
print(a*b//2)


Fixed submission:
a,b,c=map(int,input().split())
print(a*b//2)
Buggy python submission (verdict: Runtime Error):
D=int(input())
if D == 25:
    print('Christmas')
elif D == 24:
    print('Christmas Eve')
elif D == 23:
    print('Christmas Eve Eve')
elif D == 22:
    pribt('Christmas Eve Eve Eve')

Fixed submission:
D = int(input())
if D == 25:
    print('Christmas')
elif D == 24:
    print('Christmas Eve')
elif D == 23:
    print('Christmas Eve Eve')
elif D == 22:
    print('Christmas Eve Eve Eve')