Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
import sys
import numpy as np
input = sys.stdin.readline
H, W = map(int, input().split())
a = [list(input().strip()) for _ in range(H)]
a = [ai for ai in a if "#" in ai]
H = len(a)
a_T = np.array(a).T
a_T = [ai for ai in a_T if "#" in ai]
a = np.array(a_T).T
W = len(a[0])
for i in range(H):
    for j in range(W):
        print(a[i][j],end="")
    print("")

Fixed submission:
import sys
import numpy as np
input = sys.stdin.readline
H, W = map(int, input().split())
a = [list(input().strip()) for _ in range(H)]
a = [ai for ai in a if "#" in ai]
H = len(a)
a_T = np.array(a).T
a_T = [ai for ai in a_T if "#" in ai]
a = np.array(a_T).T
W = len(a[0])
for i in range(H):
    for j in range(W):
        print(a[i][j],end="")
    print("")
Buggy python submission (verdict: Runtime Error):
import sys
input = sys.stdin.readline
N = int(input())
count = 0
if N < 105:
    print(0)
else:
    for odd in range(105, N+1, 2):
        li = divisor(odd)
        if len(li) == 8:
            count += 1
    print(count)

Fixed submission:
def divisor(n):
    i = 1
    ans_div = []
    while i * i <= n:
        if n%i == 0:
            ans_div.append(i)
            ans_div.append(n // i)
        i += 1
    ans_div = list(set(ans_div))
    return ans_div
import sys
input = sys.stdin.readline
N = int(input())
count = 0
if N < 105:
    print(0)
else:
    for odd in range(105, N+1, 2):
        li = divisor(odd)
        if len(li) == 8:
            count += 1
    print(count)
Buggy python submission (verdict: Runtime Error):
import math
import sys
def lcm(a, b):
    return a*b // math.gcd(a, b)

input = sys.stdin.readline
N = int(input())
print(lcm(2, N))

Fixed submission:
from fractions import gcd
#最小公倍数
def lcm(a, b):
    return a*b // gcd(a, b)

import sys
input = sys.stdin.readline
N = int(input())
print(lcm(2, N))

Buggy python submission (verdict: Runtime Error):
import math
def lcm(a, b):
    return a*b // math.gcd(a, b)

import sys
input = sys.stdin.readline
N = int(input())
print(lcm(2, N))

Fixed submission:
from fractions import gcd
#最小公倍数
def lcm(a, b):
    return a*b // gcd(a, b)

import sys
input = sys.stdin.readline
N = int(input())
print(lcm(2, N))
Buggy python submission (verdict: Runtime Error):
import sys
input = sys.stdin.readline
A, B = map(int, input().split())
li = [A+B, A-B, A*B]
print(max(li))

Fixed submission:
import sys
input = sys.stdin.readline
a, b, c, d = map(int, input().split())
ab = abs(a-b)
bc = abs(b-c)
ac = abs(a-c)
if (ab <= d and bc <= d) or ac <= d:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
import sys
input = sys.stdin.readline
S = input().strip()
S[3] = "8"
print(S)

Fixed submission:
import sys
input = sys.stdin.readline
S = list(input().strip())
S[3] = "8"
ans = ""
for s in S:
    ans += s
print(ans)
Buggy python submission (verdict: Runtime Error):
input = sys.stdin.readline
N = input()
tmp = N[0]
count = 0
for n in N:
    if tmp == n:
        count += 1
        if count == 3:
            break
    else:
        count = 0
        tmp = n
if count == 3:
    print("Yes")
else:
    print("No")

Fixed submission:
import sys
input = sys.stdin.readline
N = list(map(int, list(input().strip())))
if sum(N[:3])%3 == 0 or sum(N[1:])%3 == 0:
    if sum(N[:3])//3 == N[0] or sum(N[1:])//3 == N[-1]:
        print("Yes")
    else:
        print("No")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
ary = input().split(" ")
a = ary[0]
b = ary[1]
c = ary[2]

if ( a == b and (a != c or b != c) ) or ( a == c and ( a != b and c != b ) ) or ( b == c and ( c != a or b != a ) :
  print("Yes") 
else :
  print("No")
 

Fixed submission:

ary = input().split(" ")
a = ary[0]
b = ary[1]
c = ary[2]

if a == b and ( a != c or b != c )  :
  print("Yes") 
elif a == c and ( a != b or c != b ) :
  print("Yes") 
elif b == c and ( b != a or c != a ) :
  print("Yes") 
else :
  print("No")

Buggy python submission (verdict: Runtime Error):
ary = input().split(" ")
a = ary[0]
b = ary[1]
c = ary[2]

if ( a == b and (a != c or b != c) ) :
elif ( a == c and ( a != b and c != b ) ) :
elif ( b == c and ( c != a or b != a ) :
  print("Yes") 
else :
  print("No")

Fixed submission:

ary = input().split(" ")
a = ary[0]
b = ary[1]
c = ary[2]

if a == b and ( a != c or b != c )  :
  print("Yes") 
elif a == c and ( a != b or c != b ) :
  print("Yes") 
elif b == c and ( b != a or c != a ) :
  print("Yes") 
else :
  print("No")
Buggy python submission (verdict: Time Limit Exceeded):
inpvals = []
lopvals = []
outvals = []

max_loop = int(input())
idx_loop = 0
while idx_loop < max_loop :
  inpvals.append(input())
  idx_loop = idx_loop+1

max_cnt = 0
lopvals = set(inpvals)
for inpval in lopvals :
  cnt = inpvals.count(inpval)

  if max_cnt <= cnt :
    if max_cnt != cnt :
      outvals = []
    max_cnt = cnt
    outvals.append(inpval)

outvals.sort()
    
for outval in outvals :
  print(outval)

Fixed submission:
from collections import defaultdict
from collections import OrderedDict

N = int(input())

words = dict()
wordsFromValue = defaultdict(list)

for idx in range(N) :
  word = str(input())
  
  if word in words :
    words[word] += 1
  else :
    words[word] = 1
  
for key, value in sorted(words.items()) :
  wordsFromValue[value].append(key)
  

for val in wordsFromValue[max(wordsFromValue)] : 
  print(val)

Buggy python submission (verdict: Time Limit Exceeded):
inpvals = []
outvals = []

max_loop = int(input())
idx_loop = 0
while idx_loop < max_loop :
  inpvals.append(input())
  idx_loop = idx_loop+1

max_cnt = 0
for inpval in set(inpvals) :
  cnt = inpvals.count(inpval)

  if max_cnt <= cnt :
    if max_cnt != cnt :
      outvals = []
    max_cnt = cnt
    outvals.append(inpval)

outvals.sort()
    
for outval in outvals :
  print(outval)

Fixed submission:
from collections import defaultdict
from collections import OrderedDict

N = int(input())

words = dict()
wordsFromValue = defaultdict(list)

for idx in range(N) :
  word = str(input())
  
  if word in words :
    words[word] += 1
  else :
    words[word] = 1
  
for key, value in sorted(words.items()) :
  wordsFromValue[value].append(key)
  

for val in wordsFromValue[max(wordsFromValue)] : 
  print(val)

Buggy python submission (verdict: Time Limit Exceeded):
inpvals = []
outvals = []

max_loop = int(input())
idx_loop = 0
while idx_loop < max_loop :
  inpvals.append(input())
  idx_loop = idx_loop+1

max_cnt = 0
for inpval in set(inpvals) :
  cnt = inpvals.count(inpval)

  if max_cnt <= cnt :
    if max_cnt != cnt :
      outvals = []
    max_cnt = cnt
    outvals.append(inpval)

outvals.sort()
    
for outval in outvals :
  print(outval)

Fixed submission:
from collections import defaultdict
from collections import OrderedDict

N = int(input())

words = dict()
wordsFromValue = defaultdict(list)

for idx in range(N) :
  word = str(input())
  
  if word in words :
    words[word] += 1
  else :
    words[word] = 1
  
for key, value in sorted(words.items()) :
  wordsFromValue[value].append(key)
  

for val in wordsFromValue[max(wordsFromValue)] : 
  print(val)
Buggy python submission (verdict: Runtime Error):
input_texts = input()
text_list = input_texts.split(" ")
text_s = text_list[0]
text_t = text_list[1]

input_counts = input()
count_list = input_counts.split(" ")
count_s = int(count_list[0])
count_t = int(count_list[1])

pull_text = input()

if pull_text == text_s:
    count_s -= 1
else:
    count_t -= 1

print(f"{str(count_s)} {str(count_t)}")

Fixed submission:
input_texts = input()
text_list = input_texts.split(" ")
text_s = text_list[0]
text_t = text_list[1]

input_counts = input()
count_list = input_counts.split(" ")
count_s = int(count_list[0])
count_t = int(count_list[1])

pull_text = input()

if pull_text == text_s:
    count_s -= 1
else:
    count_t -= 1
output = str(count_s) + " " + str(count_t)
print(output)
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = [int(i) for i in input().split()]
x = 0
for j in range(0,n):
  if not (((a[j] % 2) == 0) and (((a[j] % 3) != 0) or (a[j] % 5 != 0))):
    x = 1
if x == 1:
  print('APPROVED')
else:
  print('DENIED')

Fixed submission:
x, y, z = input().split()
if x == y:
  if x == z and y == z:
    print("No")
  else:
    print("Yes")
elif x == z:
  if x == y and y == z:
    print("No")
  else:
    print("Yes")
elif y == z:
  if x == y and x == z:
    print("No")
  else:
    print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = [int(i) for i in input().split()]
x = 0
for j in range(0,n):
  if not (((a[j] % 2) == 0) and (((a[j] % 3) != 0) and (a[j] % 5 != 0))):
    x = 1
if x == 1:
  print('APPROVED')
else:
  print('DENIED')

Fixed submission:
x, y, z = input().split()
if x == y:
  if x == z and y == z:
    print("No")
  else:
    print("Yes")
elif x == z:
  if x == y and y == z:
    print("No")
  else:
    print("Yes")
elif y == z:
  if x == y and x == z:
    print("No")
  else:
    print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
x, y, z = input.split()
if x == y:
  if x == z and y == z:
    print("No")
  elif x != z and y != z:
    print("No")
  else:
    print("Yes")
elif x == z:
  if x == y and y == z:
    print("No")
  elif x != y and y != z:
    print("No")
  else:
    print("Yes")
elif y == z:
  if x == y and x == z:
    print("No")
  elif x != y and x != z:
    print("No")
  else:
    print("Yes")
else:
  print("No")

Fixed submission:
x, y, z = input().split()
if x == y:
  if x == z and y == z:
    print("No")
  else:
    print("Yes")
elif x == z:
  if x == y and y == z:
    print("No")
  else:
    print("Yes")
elif y == z:
  if x == y and x == z:
    print("No")
  else:
    print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
s, t = input.split()
a, b = input.split()
u = input()

if u == s:
    print(a-1, b)
if u == t:
    print(a, b-1)

Fixed submission:
s, t = input().split()
a, b = input().split()
u = input()

a = int(a)
b = int(b)

if u == s:
    print(a-1, b)
if u == t:
    print(a, b-1)
Buggy python submission (verdict: Runtime Error):

N, S = input().split()

hN = int(int(N)/2)

S1 = S[:hN]
S2 = S[hN:]

if(S1 == S2):
    print('Yes')
else:
    print('No')


Fixed submission:

N = int(input())
S = input()

hN = int(int(N)/2)

S1 = S[:hN]
S2 = S[hN:]

if(S1 == S2):
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):

N, S = input().split()

hN = int(int(N)/2)

S1 = S[:hN]
S2 = S[hN:]

if(S1 == S2):
    print('Yes')
else:
    print('No')


Fixed submission:

N = int(input())
S = input()

hN = int(int(N)/2)

S1 = S[:hN]
S2 = S[hN:]

if(S1 == S2):
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
import numpy
import sys

args = sys.argv

if ((args[1]*args[2])//2)==0:
  print('Even')
else:
  print('Odd')

Fixed submission:
import sys
 
i = input().split()

if ((int(i[0])*int(i[1]))%2)==0:
  print('Even')
else:
  print('Odd')
Buggy python submission (verdict: Runtime Error):
N = int(input())
V = map(int, input().split())
a = (V[0] + V[1]) / 2
for i in range(2, N):
  a = (a + V[i]) / 2
print(a)

Fixed submission:
N = int(input())
V = sorted(map(int, input().split()))
a = (V[0] + V[1]) / 2
for i in range(2, N):
  a = (a + V[i]) / 2
print(a)
Buggy python submission (verdict: Runtime Error):
n , k , q = map(int, input().split())
points = [k] * n
for i in range(q):
    x = int(input())
    points[x] += 1
for x in points:
    x -= q
    if x <= 0:
        print("No")
    else:
        print("Yes")






Fixed submission:
n , k , q = map(int, input().split())
points = [k] * n


for i in range(q):
    x = int(input())
    points[x-1] += 1
for x in points:
    x -= q
    if x <= 0:
        print("No")
    else:
        print("Yes")

Buggy python submission (verdict: Runtime Error):
n , k , q = map(int, input().split())
points = [k] * n
#print(points)
for i in range(q):
    x = int(input())
    points[x] += 1
for x in points:
    x -= q
    if x <= 0:
        print("No")
    else:
        print("Yes")






Fixed submission:
n , k , q = map(int, input().split())
points = [k] * n


for i in range(q):
    x = int(input())
    points[x-1] += 1
for x in points:
    x -= q
    if x <= 0:
        print("No")
    else:
        print("Yes")
Buggy python submission (verdict: Runtime Error):
import collections

N = int(input())
words = []
top = int()
for i in range(N):
    words.append(input())
c = collections.Counter(words)

c_sorted = sorted(c.items(), reverse=True, key=lambda x : x[1])

top = int(c_sorted[0][1])
answer = []
count = int(0)
for i in range(N):
    if int(c_sorted[i][1]) == top:
        answer.append(c_sorted[i][0])
        count = count + 1
    else:
        break

answer.sort()

for i in range(count):
    print(answer[i])

Fixed submission:
import collections

N = int(input())
words = []
top = int()
for i in range(N):
    words.append(input())
c = collections.Counter(words)

c_sorted = sorted(c.items(), reverse=True, key=lambda x : x[1])

top = int(c_sorted[0][1])
answer = []
count = int(0)
length = len(c_sorted)
unko = str()

if length == 1:
    unko = "unko"
else:
    for i in range(N):
        if int(c_sorted[i][1]) == top:
            answer.append(c_sorted[i][0])
            count = count + 1
        else:
            break

answer.sort()

if unko == "unko":
    print(c_sorted[0][0])
else:
    for i in range(count):
        print(answer[i])
Buggy python submission (verdict: Runtime Error):
input(); d_list = list(map(int, input().split()))
sum=0
for i, x in enumerate(d_list):
  for y in d_list[i+1:]:
    sum+=x*y
print("%d" % sum)

Fixed submission:
A,B = map(int, input().split())
print("%d" % (A-2*B if A >= 2*B else 0))
Buggy python submission (verdict: Time Limit Exceeded):
input()
s=input()
max_len = 0
len_s = len(s)
for i in range(len_s-1):
    if max_len > (len_s-i):
        break
    for j in range(len_s):
        if j-i < max_len:
           continue
        if j-i > len_s - j:
            break
        if s[i:j] not in s[j:]:
            break
        max_len = max(max_len, len(s[i:j]))

print(max_len)

Fixed submission:
N=int(input())
S=input()
a=i=j=0
while j<N:
  if j-i > N-j:
      break  

  t=S[i:j]
  if t in S[j:]:
    a=max(a,len(t))
    j+=1
  else:
    i+=1
print(a)
Buggy python submission (verdict: Runtime Error):
A = input()
B = input()
C = input()

if A == B != C:
    print("yes")
elif B == C != A:
    print("yes")
elif C == A != B:
    print("yes")
else:
    print("No")

Fixed submission:
x = input().split(' ')

if  x[0] == x[1] != x[2]:
    print("Yes")
elif x[1] == x[2] != x[0]:
    print("Yes")
elif x[2] == x[0] != x[1]:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Time Limit Exceeded):
X, Y, Z, K = map(int, input().split())
A = sorted(list(map(int, input().split())), reverse=True)
K1 = min(K, len(A))

B = sorted(list(map(int, input().split())), reverse=True)
K2 = min(K, len(B))

C = sorted(list(map(int, input().split())), reverse=True)
K3 = min(K, len(C))

K12 = min(K1 * K2, K)

M1 = [0] * (K1 * K2)
k = 0
for i in range(0, K1):
    for j in range(0, K2):
        M1[k] = A[i] + B[j]
        k += 1

M1.sort(reverse=True)

M = [0] * (K12 * K3)
k = 0
for i in range(0, K12):
    for j in range(0, K3):
        M[k] = M1[i] + C[j]
        k += 1

M.sort(reverse=True)
for i in range(0, K):
    print(M[i])


Fixed submission:

X, Y, Z, K = map(int, input().split())
A = sorted(list(map(int, input().split())), reverse=True)
B = sorted(list(map(int, input().split())), reverse=True)
C = sorted(list(map(int, input().split())), reverse=True)

M = []
for i in range(0, X):
    for j in range(0, Y):
        for k in range(0, Z):
            if (i+1) * (j+1) * (k+1) <= K:
                M.append(A[i] + B[j] + C[k])
            else:
                break

M.sort(reverse=True)
for i in range(0, K):
    print(M[i])

Buggy python submission (verdict: Time Limit Exceeded):
X, Y, Z, K = map(int, input().split())
A = list(map(int, input().split()))
A.sort(reverse=True)
K1 = min(K, len(A))

B = list(map(int, input().split()))
B.sort(reverse=True)
K2 = min(K, len(B))

C = list(map(int, input().split()))
C.sort(reverse=True)
K3 = min(K, len(C))

K12 = min(K1 * K2, K)

M1 = [0] * (K1 * K2)
k = 0
for i in range(0, K1):
    for j in range(0, K2):
        M1[k] = A[i] + B[j]
        k += 1

M1.sort(reverse=True)

M = [0] * (K12 * K3)
k = 0
for i in range(0, K12):
    for j in range(0, K3):
        M[k] = M1[i] + C[j]
        k += 1

M.sort(reverse=True)

for i in range(0, K):
    print(M[i])


Fixed submission:

X, Y, Z, K = map(int, input().split())
A = sorted(list(map(int, input().split())), reverse=True)
B = sorted(list(map(int, input().split())), reverse=True)
C = sorted(list(map(int, input().split())), reverse=True)

M = []
for i in range(0, X):
    for j in range(0, Y):
        for k in range(0, Z):
            if (i+1) * (j+1) * (k+1) <= K:
                M.append(A[i] + B[j] + C[k])
            else:
                break

M.sort(reverse=True)
for i in range(0, K):
    print(M[i])
Buggy python submission (verdict: Runtime Error):
nums = input(),rstrip(),split(" ")
n1 = int(nums[0])
n2 = int(nums[1])
n3 = int(nums[2])
if n1 == n2:
  if n2 == n3:
    print("No")
  else:
    print("Yes")
else if n2 == n3:
  print("Yes")
else:
  print("No")

Fixed submission:
nums = input().rstrip().split(" ")
n1 = int(nums[0])
n2 = int(nums[1])
n3 = int(nums[2])
if n1 == n2 and n2 == n3 and n1 == n3:
  print("No")
elif n1 != n2 and n2 != n3 and n1 != n3:
  print("No")
else:
  print("Yes")

Buggy python submission (verdict: Runtime Error):
nums = input(),rstrip(),split(" ")
n1 = int(nums[0])
n2 = int(nums[1])
n3 = int(nums[2])
if n1 == n2 and n2 == n3:
  print("No")
else if n1 != n2 and n2 =! n3:
  print("No")
else:
  print("Yes")

Fixed submission:
nums = input().rstrip().split(" ")
n1 = int(nums[0])
n2 = int(nums[1])
n3 = int(nums[2])
if n1 == n2 and n2 == n3 and n1 == n3:
  print("No")
elif n1 != n2 and n2 != n3 and n1 != n3:
  print("No")
else:
  print("Yes")
Buggy python submission (verdict: Runtime Error):
a=input()
b=input()
def evenodd(a,b):
  if a*b%2==1:
    print("Odd")
  else:
    print("Even")
    
print(evenodd(a,b))

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

def evenodd(a,b):
  if a*b%2==1:
    return "Odd"
  else:
    return"Even"
    
print(evenodd(a,b))

Buggy python submission (verdict: Runtime Error):
def evenodd(a,b):
  if a*b%2==1:
    print("Odd")
  else:
    print("Even")
    
print(evenodd(a,b))
    

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

def evenodd(a,b):
  if a*b%2==1:
    return "Odd"
  else:
    return"Even"
    
print(evenodd(a,b))
Buggy python submission (verdict: Runtime Error):
a,b,c = map(int, input().split())
if a == b or b == c or c == a:
  return "Yes"
else:
  return "No"

Fixed submission:
a,b,c = map(int, input().split())
ispoor = False
if (a == b and b!=c) or (b == c and a!=b) or (c==a and c!=b):
    ispoor = True
if ispoor:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
C = list(map(int,input().split()))
 
ans = sum(B) 
for i in range(N-1):
    if A[i+1] - A[i] ==1:
        res += C[i]
print(ans)

Fixed submission:
N = int(input())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
C = list(map(int,input().split()))
 
ans = sum(B) 
for i in range(N-1):
    if A[i+1] - A[i] ==1:
        ans += C[A[i]-1]
print(ans)

Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
C = list( map(int,input().split()))
 
ans = sum(B) 
for i in range(N-1):
    if A[i+1] - A[i] ==1:
        res += C[A[i]-1]
print(ans)


Fixed submission:
N = int(input())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
C = list(map(int,input().split()))
 
ans = sum(B) 
for i in range(N-1):
    if A[i+1] - A[i] ==1:
        ans += C[A[i]-1]
print(ans)

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

ans = sum(B) 
for i in range(N-1):
    if A[i+1] - A[i] ==1:
        res += C[A[i]]
print(ans)

Fixed submission:
N = int(input())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
C = list(map(int,input().split()))
 
ans = sum(B) 
for i in range(N-1):
    if A[i+1] - A[i] ==1:
        ans += C[A[i]-1]
print(ans)
Buggy python submission (verdict: Runtime Error):
a = int(input())
4000
s = input()
yes
if a >= 3200:
    print(s)
else:
    print("red")
    

Fixed submission:
a = int(input())

s = input()

if a >= 3200:
    print(s)
else:
    print("red")

Buggy python submission (verdict: Runtime Error):
a = int(input())
4000
s = input()
yes
if a >= 3200:
  print(s)
  else a < 3200:
    print("red")
    

Fixed submission:
a = int(input())

s = input()

if a >= 3200:
    print(s)
else:
    print("red")
Buggy python submission (verdict: Runtime Error):
N = int(input())

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

print(sum 1/x for x in A)

Fixed submission:
N = int(input())

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

print(1/sum(1/x for x in A))
Buggy python submission (verdict: Runtime Error):
i=list(map(int, input().split()))
 
if i[0]==i[1] | i[0]==i[2] | i[1]==i[2]:
	if i[0]==i[1] & i[0]==i[2]  & i[1]==i[2]:
    	print('No')
	else:
		print('Yes')
else:
	print('No')

Fixed submission:
i=list(map(int, input().split()))
 
if i[0]==i[1] or i[0]==i[2] or i[1]==i[2]:
	if i[0]==i[1] and i[0]==i[2]:
		print('No')
	else:
		print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
i=list(map(int, input().split()))
 
if i[0]==i[1] | i[0]==i[2] | i[1]==i[2]:
  if i[0]==i[1] & i[0]==i[2]  & i[1]==i[2]:
	print('No')
  else:
	print('Yes')
else:
    print('No')

Fixed submission:
i=list(map(int, input().split()))
 
if i[0]==i[1] or i[0]==i[2] or i[1]==i[2]:
	if i[0]==i[1] and i[0]==i[2]:
		print('No')
	else:
		print('Yes')
else:
    print('No')

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

if i[0]==i[1] | i[0]==i[2] | i[1]==i[2]:
  if i[0]==i[1] & i[0]==i[2]:
	print('No')
  else:
	print('Yes')
else:
    print('No')

Fixed submission:
i=list(map(int, input().split()))
 
if i[0]==i[1] or i[0]==i[2] or i[1]==i[2]:
	if i[0]==i[1] and i[0]==i[2]:
		print('No')
	else:
		print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
if A==B & A==C:
	print('NO')
if A==B | A==C | B==C:
	print('YES')
else:
    print('NO')

Fixed submission:
i=list(map(int, input().split()))
 
if i[0]==i[1] or i[0]==i[2] or i[1]==i[2]:
	if i[0]==i[1] and i[0]==i[2]:
		print('No')
	else:
		print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
x=list(map(int, input().split()))
false=0

for i in range(1,x[0]+1):
    if x[i]%2 == 0:
        if x[i]%3 != 0 and x[i]%5 != 0:
            false=false+1
if false==0:
	print('APPROVED')
else:
	print('DENIED')

Fixed submission:
n=input()
a=list(map(int,input().split()))
for x in a:
    if x%2 == 1:
        continue
    if x%3==0 or x%5 == 0:
        continue
    else:
        print('DENIED')
        break
else:
    print('APPROVED')

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

for i in range(1,x[0]):
    if x[i]%2 == 0:
        if x[i]%3 != 0 or x[i]%5 != 0:
            false=false+1
if false!=1:
	print('APPROVED')
else:
	print('DENIED')

Fixed submission:
n=input()
a=list(map(int,input().split()))
for x in a:
    if x%2 == 1:
        continue
    if x%3==0 or x%5 == 0:
        continue
    else:
        print('DENIED')
        break
else:
    print('APPROVED')

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

for i in range(1,len(x)):
	if x[i]%2 ==0:
    	if x[i]%3!=0 or x[i]%5!=0
        	fasle=1
if false==1:
	print('APPROVED')
else:
	print('DENIED')

Fixed submission:
n=input()
a=list(map(int,input().split()))
for x in a:
    if x%2 == 1:
        continue
    if x%3==0 or x%5 == 0:
        continue
    else:
        print('DENIED')
        break
else:
    print('APPROVED')