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

inputs = input()
N = int(inputs)


inputs = input().split()
A = map(lambda x: int(x), inputs)

count = 1
for i in A:
    if i % 2 == 0:
        count = count * 2
        
print(3**N - count )

Fixed submission:
inputs = input()

x = list(inputs)

flag = False
for i in range(len(x) - 1):
    if x[i] == 'A' and x[i+1] == 'C':
        flag = True

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

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

x = list(inputs)

flag = False
for i in range(len(x) - 1):
    if x[i] == 'A' and x[i+1] == 'C'
        flag = True

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

Fixed submission:
inputs = input()

x = list(inputs)

flag = False
for i in range(len(x) - 1):
    if x[i] == 'A' and x[i+1] == 'C':
        flag = True

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

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

inputs = list(inputs)

flag = False
for i in range(len(inputs) - 1):
    if inputs[i] == 'A' and inputs[i+1] == 'C'
        flag = True
        
if flag:
    print('Yes')
else:
    print('No')

Fixed submission:
inputs = input()

x = list(inputs)

flag = False
for i in range(len(x) - 1):
    if x[i] == 'A' and x[i+1] == 'C':
        flag = True

if flag:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
inputs = input()

a = inputs

ans = 0
while len(a) > 1:
    if a[0] == a[-1]:
        a = a[1:-1]
    if a[0] == 'x' and a[-1] != 'x':
        ans += 1
        a += 'x'
    if a[0] != 'x' and a[-1] == 'x':
        ans += 1
        a = 'x' + a
    if a[0] != a[-1]:
        ans = -1
        break
        
print(ans)

Fixed submission:
inputs = input()

a = inputs

ans = 0
while len(a) > 1:
    if a[0] == a[-1]:
        a = a[1:-1]
    elif a[0] == 'x' and a[-1] != 'x':
        ans += 1
        a += 'x'
    elif a[0] != 'x' and a[-1] == 'x':
        ans += 1
        a = 'x' + a
    elif a[0] != a[-1]:
        ans = -1
        break
        
print(ans)
Buggy python submission (verdict: Runtime Error):
puts=input().split()
A = int(inputs[0])
B = int(inputs[1])
C = int(inputs[2])

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

Fixed submission:
inputs=input().split()
A = int(inputs[0])
B = int(inputs[1])
C = int(inputs[2])

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

Buggy python submission (verdict: Runtime Error):
inputs=input()
A = int(inputs[0])
B = int(inputs[1])
C = int(inputs[2])

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

Fixed submission:
inputs=input().split()
A = int(inputs[0])
B = int(inputs[1])
C = int(inputs[2])

if A == B:
    print(C)
elif B == C:
    print(A)
else:
    print(B)
Buggy python submission (verdict: Runtime Error):
inputs = input().split()
H = int(inputs[0])
W = int(inputs[1])

grid = []

grid.append('.'*W+'..')
for i in range(H):
    inputs = input().strip()
    inputs = '.' + inputs + '.'
    grid.append(inputs)
grid.append('.'*W+'..')


dx = [1,1,1,0,-1,-1,-1,0]
dy = [1,0,-1,-1,-1,0,1,1]

ans = [[0 for x in range(W)] for y in range(H)]

for row in range(len(grid)-2):
    for col in range(W):
        if grid[row+1][col+1] == '#':
            ans[row][col] = '#'
        for i in range(8):
            if grid[row+1 + dy[i]][col+1 + dx[i]] == '#':
                ans[row][col] += 1
                
for row in ans:
    print(''.join(map(lambda x: str(x), row)))

Fixed submission:
inputs = input().split()
H = int(inputs[0])
W = int(inputs[1])

grid = []

grid.append('.'*W+'..')
for i in range(H):
    inputs = input().strip()
    inputs = '.' + inputs + '.'
    grid.append(inputs)
grid.append('.'*W+'..')


dx = [1,1,1,0,-1,-1,-1,0]
dy = [1,0,-1,-1,-1,0,1,1]

ans = [[0 for x in range(W)] for y in range(H)]

for row in range(len(grid)-2):
    for col in range(W):
        if grid[row+1][col+1] == '#':
            ans[row][col] = '#'
        for i in range(8):
            if grid[row+1 + dy[i]][col+1 + dx[i]] == '#':
                if ans[row][col] != '#':
                    ans[row][col] += 1

for row in ans:
    print(''.join(map(lambda x: str(x), row)))
Buggy python submission (verdict: Runtime Error):
inputs = input()
N = int(inputs)

inputs = input().split()

prob = {}
for i in inputs:
    if not int(i) in prob.keys():
        prob[int(i)] = 1
    else:
        prob[int(i)] += 1

inputs = input()
M = int(inputs)

inputs = input().split()
flag = True

for i in inputs:
    prob[int(i)] -= 1
    if prob[int(i)] < 0:
        flag = False

if flag:
    print('YES')
else:
    print('NO')

Fixed submission:
inputs = input()
N = int(inputs)

inputs = input().split()

prob = {}
for i in inputs:
    if not int(i) in prob.keys():
        prob[int(i)] = 1
    else:
        prob[int(i)] += 1

inputs = input()
M = int(inputs)

inputs = input().split()
flag = True

for i in inputs:
    if not int(i) in prob.keys():
        flag = False
    else:
        prob[int(i)] -= 1
        if prob[int(i)] < 0:
            flag = False

if flag:
    print('YES')
else:
    print('NO')

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

inputs = input().split()

prob = {}
for i in inputs:
    if not int(i) in prob.keys():
        prob[int(i)] = 1
    else:
        prob[int(i)] += 1

inputs = input()
M = int(inputs)

inputs = input().split()
flag = True

for i in inputs:
    prob[int(i)] -= 1
    if prob[int(i)] < 0:
        flag = False

if flag:
    print('YES')
else:
    print('NO')

Fixed submission:
inputs = input()
N = int(inputs)

inputs = input().split()

prob = {}
for i in inputs:
    if not int(i) in prob.keys():
        prob[int(i)] = 1
    else:
        prob[int(i)] += 1

inputs = input()
M = int(inputs)

inputs = input().split()
flag = True

for i in inputs:
    if not int(i) in prob.keys():
        flag = False
    else:
        prob[int(i)] -= 1
        if prob[int(i)] < 0:
            flag = False

if flag:
    print('YES')
else:
    print('NO')
Buggy python submission (verdict: Runtime Error):
inputs = input().split

print(inputs.count('1'))

Fixed submission:
inputs = input()

print(inputs.count('1'))
Buggy python submission (verdict: Runtime Error):
raw1 = input().split()
H = int(raw1[0])
W = int(raw1[1])

c = [0 for x in range(26)]

for i in range(H):
    raw = input()
    for j in range(W):
        c[ord(raw[j]) - 97] += 1

for i in range(len(c)):
    c[i] = c[i] % 4


if c.count(3) > 0 :
    print('No')
elif W%2 == 1 and H%2 == 1 and c.count(1) == 1 and c.count(2) == (H-1)/2 +(W-1)/2:
    print('Yes')
elif W%2 == 0 and H%2==0 and c.count(1)==0 and c.count(2) ==0:
    print('Yes')
elif W % 2 ==0 and  H % 2  == 1 and c.count(1) == 0 and c.count(2) == W/2:
    print('Yes')
elif W % 2 ==1 and  H % 2  == 0 and c.count(1) == 0 and c.count(2) == H/2:
    print('Yes')
else:
    print('No')

Fixed submission:
i = input()

if len(i) < 4:
    print('No')
elif i[:4] == 'YAKI':
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
K = int(input().split())
A, B = map(int, input().split())
for i in range(A,B+1):
  if i%K == 0:
    print('OK')
  else:
    print('NG')

Fixed submission:
K = int(input())
A, B = map(int, input().split())
C = 0
for i in range(A,B+1):
  if i%K == 0:
    print('OK')
    C = 1
    break
if C == 0:
  print('NG')
Buggy python submission (verdict: Runtime Error):
import math
A, B, N = map(int, input().split())
def kansu(x):
  S = floor(A*x/B)
  return S
print(min(kansu(N), kansu(B)))


Fixed submission:
import math
A, B, N = map(int, input().split())
def kansu(x):
  S = math.floor(A*x/B)
  return S
print(min(kansu(N), kansu(B-1)))

Buggy python submission (verdict: Runtime Error):
import floor from math
A, B, N = map(int, input().split())
def kansu(x):
  S = floor(A*x/B)
  return S
print(min(kansu(N), kansu(B)))

Fixed submission:
import math
A, B, N = map(int, input().split())
def kansu(x):
  S = math.floor(A*x/B)
  return S
print(min(kansu(N), kansu(B-1)))
Buggy python submission (verdict: Time Limit Exceeded):
def main():
  n, d, mods = 0, 1, [1]+[0]*2019
  for i in reversed(input()):
    n = (n+int(i)*d)%2019
    d = d*10
    mods[n] += 1
  print(sum([i*(i-1)//2 for i in mods]))
main()


Fixed submission:
def main():
  n, d, mods = 0, 1, [1]+[0]*2019
  for i in reversed(input()):
    n = (n+int(i)*d)%2019
    d = d*10%2019
    mods[n] += 1
  print(sum([i*(i-1)//2 for i in mods]))
main()

Buggy python submission (verdict: Time Limit Exceeded):
S = list(input())
P = 0
for i in range(len(S)-3):
    for j in range(i+4,len(S)+1):
        M = ''.join(S[i:j])
        N = int(M)
        if N%2019 == 0:
            P += 1
print(P)


Fixed submission:
def main():
  n, d, mods = 0, 1, [1]+[0]*2019
  for i in reversed(input()):
    n = (n+int(i)*d)%2019
    d = d*10%2019
    mods[n] += 1
  print(sum([i*(i-1)//2 for i in mods]))
main()

Buggy python submission (verdict: Time Limit Exceeded):
S = list(input())
P = 0
for i in range(len(S)-3):
    for j in range(i+4,len(S)+1):
        M = '0'
        for k in range(j-i):
            M += S[i+k]
        N = int(M)
        if N%2019 == 0:
            P += 1
print(P)

Fixed submission:
def main():
  n, d, mods = 0, 1, [1]+[0]*2019
  for i in reversed(input()):
    n = (n+int(i)*d)%2019
    d = d*10%2019
    mods[n] += 1
  print(sum([i*(i-1)//2 for i in mods]))
main()
Buggy python submission (verdict: Runtime Error):
import math
R = int(input())
L = R*math.pie
print(L)

Fixed submission:
import math
R = int(input())
L = 2*R*math.pi
print(L)
Buggy python submission (verdict: Runtime Error):
N, M = map(int, input().split())
A = [int(input().split()) for i in range(M)]
 
if(sum(A) == N):
  print('0')
elif(sum(A) > N):
  print(N - sum(A))
else:
  print('-1')

Fixed submission:
N, M = map(int, input().split())
A = input().split()
B = [ ]
for i in range(M):
  B.append(int(A[i]))
if(sum(B) == N):
  print('0')
elif(sum(B) < N):
  print(N - sum(B))
else:
  print('-1')

Buggy python submission (verdict: Runtime Error):
N, M = map(int, input().split())
A = [input().split() for i in range(M)]
 
if(sum(A) == N):
  print('0')
elif(sum(A) > N):
  print(N - sum(A))
else:
  print('-1')

Fixed submission:
N, M = map(int, input().split())
A = input().split()
B = [ ]
for i in range(M):
  B.append(int(A[i]))
if(sum(B) == N):
  print('0')
elif(sum(B) < N):
  print(N - sum(B))
else:
  print('-1')

Buggy python submission (verdict: Runtime Error):
N, M = map(int, input().split())
A = [input() for i in range(M)]
 
if(sum(A) == N):
  print('0')
elif(sum(A) > N):
  print(N - sum(A))
else:
  print('-1')

Fixed submission:
N, M = map(int, input().split())
A = input().split()
B = [ ]
for i in range(M):
  B.append(int(A[i]))
if(sum(B) == N):
  print('0')
elif(sum(B) < N):
  print(N - sum(B))
else:
  print('-1')

Buggy python submission (verdict: Runtime Error):
N, M = map(int, input().split())
A = [input() for i in range(M)]

if(sum(A) = N):
  print('0')
elif(sum(A) > N):
  print(N - sum(A))
else:
  print('-1')

Fixed submission:
N, M = map(int, input().split())
A = input().split()
B = [ ]
for i in range(M):
  B.append(int(A[i]))
if(sum(B) == N):
  print('0')
elif(sum(B) < N):
  print(N - sum(B))
else:
  print('-1')
Buggy python submission (verdict: Runtime Error):
N = int(input())
Q = 0
for i in range(1,N+1):
  if(i%3 !== 0 and i%5 !== 0):
      Q += i
print(Q)

Fixed submission:
N = int(input())
Q = 0
for i in range(1,N+1):
  if(i%3 != 0 and i%5 != 0):
      Q += i
print(Q)

Buggy python submission (verdict: Runtime Error):
N = int(input())
Q = 0
for i in range(N+1):
  if(N%3 !== 0 and N%5 !== 0):
      Q += i
print(Q)

Fixed submission:
N = int(input())
Q = 0
for i in range(1,N+1):
  if(i%3 != 0 and i%5 != 0):
      Q += i
print(Q)

Buggy python submission (verdict: Runtime Error):
N = int(input())
Q = 0
for i in range(N+1):
  if(N%3 !== 0 or N%5 !== 0):
      Q += i
print(Q)

Fixed submission:
N = int(input())
Q = 0
for i in range(1,N+1):
  if(i%3 != 0 and i%5 != 0):
      Q += i
print(Q)

Buggy python submission (verdict: Time Limit Exceeded):
N = input()
Q = 0
for i in range(int(N)+1):
  P = []
  for j in range(len(str(i))):
    k= str(i)
    P.append(int(k[j]))
  if(sum(P)%3 == 0 or P[-1]%5 == 0):
      Q += 0
  else:
      Q += i
print(Q)

Fixed submission:
N = int(input())
Q = 0
for i in range(1,N+1):
  if(i%3 != 0 and i%5 != 0):
      Q += i
print(Q)

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

for i in range(N+1):
  if(N%3 !> 0 !< N%5):
    M += i
print(M)
        

Fixed submission:
N = int(input())
Q = 0
for i in range(1,N+1):
  if(i%3 != 0 and i%5 != 0):
      Q += i
print(Q)

Buggy python submission (verdict: Time Limit Exceeded):
N = input()
Q = 0
for i in range(int(N)+1):
  P = []
  for j in range(len(str(i))):
    k= str(i)
    P.append(int(k[j]))
  if(sum(P)%3 == 0 and P[-1]%5 == 0):
      Q += 0
  elif(sum(P)%3 == 0):
      Q += 0
  elif(P[-1] == 0 or P[-1] == 5):
      Q += 0
  else:
      Q += i
print(Q)

Fixed submission:
N = int(input())
Q = 0
for i in range(1,N+1):
  if(i%3 != 0 and i%5 != 0):
      Q += i
print(Q)

Buggy python submission (verdict: Runtime Error):
 = input()
Q = 0
for i in range(int(N)):
  P = []
  for j in range(len(str(i))):
    k= str(i)
    P.append(int(k[j]))
  if(sum(P)%3 == 0 and P[-1]/5 == 0):
      Q += 0
  elif(sum(P)%3 == 0):
      Q += 0
  elif(P[-1] == 0 or P[-1] == 5):
      Q += 0
  else:
      Q += i
print(Q)

Fixed submission:
N = int(input())
Q = 0
for i in range(1,N+1):
  if(i%3 != 0 and i%5 != 0):
      Q += i
print(Q)

Buggy python submission (verdict: Runtime Error):
N = input()
Q = 0
for i in range(int(N)):
  P = []
  for j in range(len(str(i))):
    k= str(j)
    P.append(int(k[j]))
  if(sum(P)%3 == 0 and P[-1] == 0 or P[-1] == 5):
    Q += 0
  elif(sum(P)%3 == 0):
    Q += 0
  elif(P[-1] == 0 or L[-1] == 5):
    Q += 0
  else:
    Q += i
print(Q)

Fixed submission:
N = int(input())
Q = 0
for i in range(1,N+1):
  if(i%3 != 0 and i%5 != 0):
      Q += i
print(Q)
Buggy python submission (verdict: Runtime Error):
import numpy as np
K = int(input())
a = np.arange(a,K+1)
b = np.gcd.outer(np.gcd.outer(a, a), a)
print(np.sum(b))


Fixed submission:
import numpy as np
K = int(input())
a = np.arange(1,K+1)
b = np.gcd.outer(np.gcd.outer(a, a), a)
print(np.sum(b))

Buggy python submission (verdict: Runtime Error):
import numpy as np
K = int(input())
a = np.arrange(a,K+1)
b = np.gcd.outer(np.gcd.outer(a, a), a)
print(np.sum(b))

Fixed submission:
import numpy as np
K = int(input())
a = np.arange(1,K+1)
b = np.gcd.outer(np.gcd.outer(a, a), a)
print(np.sum(b))

Buggy python submission (verdict: Runtime Error):
from numpy import gcd
N = int(input())
a = np.arange(1,N+1)
b = np.gcd.outer(np.gcd.outer(a,a), a)
print(b)

Fixed submission:
import numpy as np
K = int(input())
a = np.arange(1,K+1)
b = np.gcd.outer(np.gcd.outer(a, a), a)
print(np.sum(b))
Buggy python submission (verdict: Runtime Error):
N, M = map(int, input().split())
A = list(map(int,input().split()))
B = 0
for i in A:
  if(A[i] >= 1/(4*M)):
    B += 1
if(B >= M):
  print('Yes')
else:
  print('No')

Fixed submission:
N, M = map(int, input().split())
A = list(map(int,input().split()))
B = 0
for i in range(N):
  if(A[i] >= sum(A)/(4*M)):
    B += 1
if(B >= M):
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Time Limit Exceeded):
N, M = map(int, input().split())
for i in range(10**18):
    if(abs(N-M)<=N):
        N = abs(N-M)
    else:
        print(N)
        break

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

Nn = N%M
Nm = abs(Nn - M)

if(Nn >= Nm):
    print(Nm)
else:
    print(Nn)
Buggy python submission (verdict: Runtime Error):
S = input()
 
if (S[2] = S[3] and S[4] = S[5]):
  print("Yes")
else:
  print("No")

Fixed submission:
S = input()
 
if (S[2] == S[3] and S[4] == S[5]):
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
S = input()
 
if (S[2] = S[3] and S[4] = S[5]):
  print(Yes)
else:
  print(No)

Fixed submission:
S = input()
 
if (S[2] == S[3] and S[4] == S[5]):
  print("Yes")
else:
  print("No")

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

if (a[2] = a[3] and a[4] = a[5]):
  print(Yes)
else:
  print(No)

Fixed submission:
S = input()
 
if (S[2] == S[3] and S[4] == S[5]):
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
S = list(input())
n = (len(S)-1)//2
for i in range(n):
  if S[i] == S[-(i+1)] and S[i] == S[i+n+1]:
    continue
  else:
    print('No')
for i in 
print('Yes')

Fixed submission:
S = list(input())
n = (len(S)-1)//2
m = 0
for i in range(n):
  if S[i] == S[-(i+1)] and S[i] == S[i+n+1]:
    continue
  else:
    print('No')
    m = 1
    break
if m < 1:
  print('Yes')
Buggy python submission (verdict: Runtime Error):
A, B, M = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
x = [map(int, input().split()) for i in rangeM]
print(min(min(a)+min(b),a[x[0]-1]+b[x[1]-1]-x[2]))

Fixed submission:
A, B, M = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = []
for i in range(M):
    xi = list(map(int, input().split()))
    c.append(a[xi[0]-1]+b[xi[1]-1]-xi[2])
print(min(min(a)+min(b), min(c)))
Buggy python submission (verdict: Runtime Error):
X = input()
Y = X.count("A")
Z = X.count("B")
if (Y == 3 or Z ==3):
  print("Yes")
else
  print("No")

Fixed submission:
X = input()
Y = X.count("A")
Z = X.count("B")
if (Y == 3 or Z == 3):
  print("No")
else:
  print("Yes")

Buggy python submission (verdict: Runtime Error):
X = input()
Y = X.count("A")
Z = X.count("B")
if (Y == 3 or X ==3):
  print("Yes")
else
  print("No")

Fixed submission:
X = input()
Y = X.count("A")
Z = X.count("B")
if (Y == 3 or Z == 3):
  print("No")
else:
  print("Yes")

Buggy python submission (verdict: Runtime Error):
X = input()
Y = len(X)
if (Y == 3):
  print("Yes")
else
  print("No")

Fixed submission:
X = input()
Y = X.count("A")
Z = X.count("B")
if (Y == 3 or Z == 3):
  print("No")
else:
  print("Yes")

Buggy python submission (verdict: Runtime Error):
X = input()
Y = len(X)
if (Y = 3):
  print("Yes")
else
  print("No")

Fixed submission:
X = input()
Y = X.count("A")
Z = X.count("B")
if (Y == 3 or Z == 3):
  print("No")
else:
  print("Yes")
Buggy python submission (verdict: Runtime Error):
A, B = map(int, input().split())
C = A//0.08
if(C*0.1 = B):
  print(C)
else:
  print(-1)

Fixed submission:
A, B = map(int, input().split())
A1 = A/0.08
A2 = (A+1)/0.08
B1 = B/0.1
B2 = (B+1)/0.1
C = 0
for i in range(1001):
  if A1 <= i < A2 and B1 <= i < B2:
    print(i)
    C = 1
    break
if C == 0:
  print(-1)
Buggy python submission (verdict: Runtime Error):
N,R = map(int, input().split())
if N >= 10:
  print(R)
else:
  print(R+100*(10-K))

Fixed submission:
N,R = map(int, input().split())
if N >= 10:
  print(R)
else:
  print(R+100*(10-N))

Buggy python submission (verdict: Runtime Error):
N, R = map(int, input().split())
if N >= 10:
  print(R)
else:
  print(R-100*(10-K))

Fixed submission:
N,R = map(int, input().split())
if N >= 10:
  print(R)
else:
  print(R+100*(10-N))
Buggy python submission (verdict: Runtime Error):
N, K = map(int, input().split())
cnt = 0
while True:
  cnt += 1
  N = N//K
  if N != 0:
print(cnt) 

Fixed submission:
N, K = map(int, input().split())
cnt = 0
while True:
  cnt += 1
  N = N//K
  if N == 0:
    break
print(cnt)
Buggy python submission (verdict: Runtime Error):
S, T = input().split()
A, B = map(int, input().split())
U = input()
if U == S:
  print(A-1, B):
else:
  print(A, B-1)

Fixed submission:
S, T = input().split()
A, B = map(int, input().split())
U = input()
if U == S:
  print(A-1, B)
else:
  print(A, B-1)
Buggy python submission (verdict: Runtime Error):
H = int(input())
I = len(bin(H)-3)
Sn = 2**(I+1)-1
print(Sn)

Fixed submission:
H = int(input())
I = len(bin(H))-3
Sn = 2**(I+1)-1
print(Sn)
Buggy python submission (verdict: Runtime Error):
A = list(map(int, input().split()))
print('bust' if sum(a) >= 22 else 'win')

Fixed submission:
a = list(map(int, input().split()))
print('bust' if sum(a) >= 22 else 'win')
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = N//1.08
for i in range(100):
  if N/1.08 <= A+i <= (N+1)/1.08 and N/1.08 <= A+i:
    print(A+i)
  elif N/1.08 >= A+i:
  else:
    break
    


Fixed submission:
N = int(input())
A = N//1.08
if (N+1)//1.08 - N//1.08 == 0:
  print(':(')
else:
  print(int((N+1)//1.08))
Buggy python submission (verdict: Runtime Error):
s = input()
A =['SAT', 'FRI', 'THU', 'WED', 'TUE', 'MON','SUN']
for i in range(7):
  if A[i] == S:
    print(i+1)
    break


Fixed submission:
S = input()
A =['SAT', 'FRI', 'THU', 'WED', 'TUE', 'MON','SUN']
for i in range(7):
  if A[i] == S:
    print(i+1)
    break

Buggy python submission (verdict: Runtime Error):
s = input()
A =['SAT', 'FRI', 'THU', 'WED', 'TUE', 'MON','SUN']
for i in range(1, 8):
  if A[i] == S:
    print(i)
    break

Fixed submission:
S = input()
A =['SAT', 'FRI', 'THU', 'WED', 'TUE', 'MON','SUN']
for i in range(7):
  if A[i] == S:
    print(i+1)
    break
Buggy python submission (verdict: Runtime Error):
N = int(input)
print(N/2 if N%2==0 else (N+1)/2)

Fixed submission:
N = int(input())
print(N/2/N if N%2==0 else (N+1)/2/N)
Buggy python submission (verdict: Runtime Error):
n = int(input())
A = list(map(list(), input().split()))
ans = [0]*n
for i in range(n):
  ans[A[i]-1] = i+1
ans.sort()
print(ans)

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

Buggy python submission (verdict: Runtime Error):
n = int(input().split())
A = list(map(int, input().split()))
A_sort = sorted(A, reverse=True)
print(*A)

Fixed submission:
n = int(input())
A = list(map(int, input().split()))
ans = [0]*n
for i in range(n):
  ans[A[i]-1] = i+1
print(*ans)
Buggy python submission (verdict: Runtime Error):
N = ['Sunny', 'Cloudy', 'Rainy']
S = input()
print(N.index(N.index(input())%3))

Fixed submission:
N = ['Sunny', 'Cloudy', 'Rainy']
print(N[(N.index(input())+1)%3])
Buggy python submission (verdict: Runtime Error):
import numpy as np
N = int(input())
A = np.array(list(map(int, input().solit())))
print(1/sum(1/A))

Fixed submission:
import numpy as np
N = int(input())
A = np.array(list(map(int, input().split())))
print(1/sum(1/A))
Buggy python submission (verdict: Runtime Error):
N = int(input())
cnt = 0
for i in range(N):
  if len(i)%2 == 1:
    cnt += 1
print(cnt)


Fixed submission:
N = int(input())
cnt = 0
for i in range(1,N+1):
  if len(str(i))%2 == 1:
    cnt += 1
print(cnt)

Buggy python submission (verdict: Runtime Error):
N = int(input())
cnt = 0
for i in range(N):
  if len(i)%2 == 1:
    cnt += 0
print(cnt)

Fixed submission:
N = int(input())
cnt = 0
for i in range(1,N+1):
  if len(str(i))%2 == 1:
    cnt += 1
print(cnt)
Buggy python submission (verdict: Runtime Error):
N = int(input())
P = list(map(int, input().split()))
cnt = 0
for i in range(N-1):
  if i+1 == P[i]:
    continue
  elif i+1 != P[i] and P[P[i]] == i+1:
    cnt = 1
  elif cnt == 0:
    print('NO')
    cnt = 2
    break
if cnt!=2:
  print('YES')

Fixed submission:
N = int(input())
P = list(map(int, input().split()))
cnt = 0
for i in range(N):
  if i+1 != P[i]:
    cnt += 1
print('NO' if cnt>2 else 'YES')

Buggy python submission (verdict: Runtime Error):
 = int(input())
P = list(map(int, input().split()))
cnt = 0
for i in range(N-1):
  if i+1 == P[i]:
    continue
  elif i+1 != P[i] and P[P[i]] == i+1:
    cnt = 1
  elif cnt == 0:
    print('NO')
    cnt = 2
    break
if cnt!=2:
  print('NYES')

Fixed submission:
N = int(input())
P = list(map(int, input().split()))
cnt = 0
for i in range(N):
  if i+1 != P[i]:
    cnt += 1
print('NO' if cnt>2 else 'YES')

Buggy python submission (verdict: Runtime Error):
N = int(input())
P = list(map(int, input().split()))
cnt = 0
for i in range(N-1):
  if i+1 == P[i]:
    continue
  elif i+1 != P[i] and P[P[i]] == i+1:
    cnt = 1
  elif cnt == 0:
    print('NO')
    cnt = 2
    break
print('YES' if cnt!=2)

Fixed submission:
N = int(input())
P = list(map(int, input().split()))
cnt = 0
for i in range(N):
  if i+1 != P[i]:
    cnt += 1
print('NO' if cnt>2 else 'YES')
Buggy python submission (verdict: Runtime Error):
print(int(input()**2*3))

Fixed submission:
print(int(input())**2*3)