Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
import math
n = int(input())
root = math.ceil(math.sqrt(n))
nums = []
for i in range(1,root+1):
  if n % i == 0:
    count_i = len(str(i))
    count_j = len(str(j))
    ans = max(count_i,count_j)  
    nums.append(ans) 
nummm = sorted(nums,reverse = True)
print(nummm[0])

Fixed submission:
import math
n = int(input())
root_n = math.ceil(math.sqrt(n))
f = []
for i in range(1,root_n+1):
  if n % i == 0:
    f_pair = max(len(str(int(i))),len(str(int(n/i))))
    f.append(f_pair)
mini = min(f)
print(mini)

Buggy python submission (verdict: Runtime Error):
import math
n = int(input())
root = math.ceil(math.sqrt(n))
nums = []
for i in range(1,root+1):
  for j in range(1,root + 1):
    if i*j == n:
      count_i = len(str(i))
      count_j = len(str(j))
      ans = max(count_i,count_j)  
      nums.append(ans)
nummm = sorted(nums,reverse = True)
print(nummm[0])

Fixed submission:
import math
n = int(input())
root_n = math.ceil(math.sqrt(n))
f = []
for i in range(1,root_n+1):
  if n % i == 0:
    f_pair = max(len(str(int(i))),len(str(int(n/i))))
    f.append(f_pair)
mini = min(f)
print(mini)
Buggy python submission (verdict: Runtime Error):
5
1 2 3 4 5

Fixed submission:
n = int(input())
line = map(int,input().split())
odd = []
for i in line:
  if i % 2 == 1:
    odd.append(i)
if len(odd) % 2 == 0:
  print("YES")
else:
  print("NO")
Buggy python submission (verdict: Time Limit Exceeded):
k,s = map(int,input().split())
count = 0
for i in range(k+1):
  for j in range(k+1):
    for k in range(k+1):
      result = i + j + k
      if result == s:
        count += 1
print(count)

Fixed submission:
line = input().split(" ")
k = int(line[0])
s = int(line[1])
count = 0
for i in range(k+1):
  for j in range(k+1):
    if s - i - j <= k and s - i - j >= 0:
      count += 1
print(count)

Buggy python submission (verdict: Time Limit Exceeded):
line = input().split(" ")
k = int(line[0])
s = int(line[1])
count = 0
for i in range(k+1):
  for j in range(k+1):
    for l in range(k+1):
      if s == i + j + l:
        count += 1
print(count)

Fixed submission:
line = input().split(" ")
k = int(line[0])
s = int(line[1])
count = 0
for i in range(k+1):
  for j in range(k+1):
    if s - i - j <= k and s - i - j >= 0:
      count += 1
print(count)

Buggy python submission (verdict: Time Limit Exceeded):
line = input().split(" ")
k = int(line[0])
s = int(line[1])
count = 0
for i in range(k+1):
  for j in range(k+1):
    for l in range(k+1):
      if s == i + j + l:
        count += 1
print(count)
        

Fixed submission:
line = input().split(" ")
k = int(line[0])
s = int(line[1])
count = 0
for i in range(k+1):
  for j in range(k+1):
    if s - i - j <= k and s - i - j >= 0:
      count += 1
print(count)
Buggy python submission (verdict: Time Limit Exceeded):
N,X,Y = (int(i) for i in input().split())


NUM = [0] * (N-1)

for i in range(1,N):
    for j in range(i+1,N+1):
        num = min(abs(i-j), abs(X-i)+1+abs(Y-j), abs(Y-i) + 1 + abs(X-j))
        if (num < N):
            NUM[num-1] += 1


for i in range(len(NUM)):
    print(NUM[i])




Fixed submission:
def main():
    n, x, y = (int(i) for i in input().split())
    num_list = [0] * (n - 1)

    for i in range(1, n):
        for j in range(i + 1, n + 1):
            num = min(abs(i - j), abs(x - i) + 1 + abs(y - j), abs(y - i) + 1 + abs(x - j))
            if (num < n):
                num_list[num - 1] += 1

    for i in range(len(num_list)):
        print(num_list[i])


if __name__ == '__main__':
    main()
Buggy python submission (verdict: Runtime Error):
N = int(input())
B = list(map(int, input().split()))

SUM = 0
A = [0]*N

for i in range(N-1):
    if i == 0:
        A[i] = B[i]
        if B[i] > B[i+1]:
            A[i+1] = B[i+1]
        else:
            A[i+1] = B[i]
        continue
        
    if i < N-2:
        if B[i] > B[i+1]:
            A[i+1] = B[i+1]
        else:
            A[i+1] = B[i]
    else:
        A[i+1] = B[i]


print(sum(A))





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

SUM = 0
A = [0]*N

for i in range(N-1):
    if i == 0:
        A[i] = B[i]

        if len(B) <= 1:
            A[i + 1] = B[i]
        else:
            if B[i] > B[i+1]:
                A[i+1] = B[i+1]
            else:
                A[i+1] = B[i]
        continue

    if i < N-2:
        if B[i] > B[i+1]:
            A[i+1] = B[i+1]
        else:
            A[i+1] = B[i]
    else:
        A[i+1] = B[i]

print(sum(A))
Buggy python submission (verdict: Runtime Error):
import fractions

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

A = ABCD[0]
B = ABCD[1]
C = ABCD[2]
D = ABCD[3]


def lcm(x, y):
    return (x * y) // fractions.gcd(x, y)


firstC = int((A-1)/C)
firstD = int((A-1)/D)
firstCD = int((A-1)/lcm(C,D))

# if A%lcm(C,D) ==0 and firstCD > 0:
#     firstCD -= 1

endC = int(B/C)
endD = int(B/D)
endCD = int(B/lcm(C,D))

End = B-endC-firstD + endCD
First = (A-1) - firstC - firstD + firstCD



thereC = endC - firstC
thereD = endD - firstD
thereCD = endCD - firstCD

NoP = thereC+thereD - thereCD

# print(thereC)
# print(thereD)
# print(thereCD)
# print(NoP)
print((B-A+1)-NoP)
# print(End-First)









Fixed submission:

S = input()

word = "p"
Judge = True

for i in range(len(S)):
    if word == S[i]:
        Judge = False
        break

    word = S[i]

if Judge:
    print("Good")
else:
    print("Bad")
Buggy python submission (verdict: Runtime Error):
x, n = map(int, input().split())
if n == 0:
    print(x)
else:
    p = list(map(int, input().split()))

    p.sort()
    y = 0

    for i in range(n):
        if p[i] <= x:
            y = i
            if i != n-1 and x < p[i+1]:
                break 

    i = 0
    while 1 == 1:
        if 0 <= y - i and x - i != p[y - i]:
            print(x - i)
            break
        if y + i < n and x + i != p[y + i]:
            print(x + i)
            break
        i = i + 1

Fixed submission:
x = list(map(int, input().split()))
for i in range(5):
    if x[i] == 0:
        print(i+1)
        break
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))

multi = 1
for i in range(n):
    multi = multi * a[i]
if multi <= 1000000000000000000:
    print(multi)
else:
    print(-1)

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

multi = 1
if min(a) == 0:
    print(0)
else:
    for i in range(n):
        multi = multi * a[i]
        if multi > 1000000000000000000:
            print(-1)
            break
    if multi <= 1000000000000000000:
        print(multi)
Buggy python submission (verdict: Runtime Error):
n, m, x = map(int, input().split())
l = [list(map(int, input().split())) for i in range(n)]

mincost = 0
for i in range(m):
    mincost += l[i][0]

s = []
for i in range(m):
    s.append(0)

flag = 0

for i in range(2 ** n):
    cost = 0
    for j in range(n):
        if ((i >> j) & 1):
            cost += l[j][0]
            for k in range(1, m):
                s[k] += l[j][k]
    b = 1
    for k in range(1, m):
        if s[k] < x:
            b = 0 
    if b == 1:
        flag = 1
        mincost = min(cost, mincost)
    for i in range(m):
        s[i] = 0

if flag == 1:
    print(mincost)
else:
    print(-1)


Fixed submission:
n, m, x = map(int, input().split())
l = [list(map(int, input().split())) for i in range(n)]

mincost = 0
for i in range(n):
    mincost += l[i][0]

s = []
for i in range(m+1):
    s.append(0)

flag = 0

for i in range(2 ** n):
    cost = 0
    for j in range(n):
        if ((i >> j) & 1):
            cost += l[j][0]
            for k in range(1, m+1):
                s[k] += l[j][k]
    b = 1
    for k in range(1, m+1):
        if s[k] < x:
            b = 0 
    if b == 1:
        flag = 1
        mincost = min(cost, mincost)
    for i in range(m+1):
        s[i] = 0

if flag == 1:
    print(mincost)
else:
    print(-1)

Buggy python submission (verdict: Runtime Error):
n, m, x = map(int, input().split())
l = [list(map(int, input().split())) for i in range(n)]

mincost = 0
for i in range(m):
    mincost += l[i][0]

s = []
for i in range(m):
    s.append(0)

flag = 0

for i in range(2 ** n):
    cost = 0
    for j in range(n):
        if ((i >> j) & 1):
            cost += l[j][0]
            for k in range(m):
                s[k] += l[j][k]
    b = 1
    for k in range(m):
        if s[k] < x:
            b = 0 
    if b == 1:
        flag = 1
        mincost = min(cost, mincost)
    for i in range(m):
        s[i] = 0

if flag == 1:
    print(mincost)
else:
    print(-1)


Fixed submission:
n, m, x = map(int, input().split())
l = [list(map(int, input().split())) for i in range(n)]

mincost = 0
for i in range(n):
    mincost += l[i][0]

s = []
for i in range(m+1):
    s.append(0)

flag = 0

for i in range(2 ** n):
    cost = 0
    for j in range(n):
        if ((i >> j) & 1):
            cost += l[j][0]
            for k in range(1, m+1):
                s[k] += l[j][k]
    b = 1
    for k in range(1, m+1):
        if s[k] < x:
            b = 0 
    if b == 1:
        flag = 1
        mincost = min(cost, mincost)
    for i in range(m+1):
        s[i] = 0

if flag == 1:
    print(mincost)
else:
    print(-1)
Buggy python submission (verdict: Runtime Error):
46 4 40 5

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

for i in range(1000):
    c = c - b
    if c <= 0:
        print('Yes')
        break
    a = a - d
    if a <= 0:
        print('No')
        break
Buggy python submission (verdict: Runtime Error):
n=eval(input())
t=(n//1000)+1
f=1000*t-n
pring(f)

Fixed submission:
n=eval(input())
f=(n//1000)
o=n/1000
if o==f:
  print(0)
else:
  p=(f+1)*1000-n
  print(p)

Buggy python submission (verdict: Runtime Error):
n = int(input()) 
maisu = math.floor( (n+1000-1)/1000 )
val = maisu*1000 - n
 
print(val)

Fixed submission:
import math
n = int(input()) 
maisu = math.floor( (n+1000-1)/1000 )
val = maisu*1000 - n
 
print(val)

Buggy python submission (verdict: Runtime Error):
n = int(input()) 
maisu = math.floor( (n+1000-1)/1000 )
val = maisu*1000 - n

print val

Fixed submission:
import math
n = int(input()) 
maisu = math.floor( (n+1000-1)/1000 )
val = maisu*1000 - n
 
print(val)
Buggy python submission (verdict: Runtime Error):
l = int(input().split())

a = int(l[0])
b = int(l[1])

n = b - a

h = n * (n + 1) // 2

print(h-b)

Fixed submission:
l = input().split()

a = int(l[0])
b = int(l[1])

n = b - a

h = n * (n + 1) // 2

print(h-b)
Buggy python submission (verdict: Runtime Error):
import numpy as np

line = input()

N = int(line)
A = np.array([0]*N)

for i in range(N):
    line = input()
    A[i] = int(line)

    
def IsNotPossible(A):
    foo = 0
    
    if A[0] != 0:
        foo = 1
        return foo
        
    else:
        for i in range(N-1):
            if A[i] + 1 < A[i+1]:
                foo  = 1
                break
        return foo

if IsNotPossible(A):
    print(-1)
    
else:
    count = 0
    for i in range(N-1):
        a = A[N-1-i]
        
        if a == 0:
            continue
        elif a == A[N-2-i] + 1:
            count += 1
        else:
            count += a
            
    print(count)

Fixed submission:
line = input().split()

A = int( line[0] )
B = int( line[1] )
C = int( line[2] )
K = int( line[3] )

if K % 2 == 0:
    print(A-B)
    
else:
    print(B-A)

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

N = int(line)
A = np.array([0]*N)

for i in range(N):
    line = input()
    A[i] = int(line)

    
def IsNotPossible(A):
    foo = 0
    
    if A[0] != 0:
        foo = 1
        return foo
        
    else:
        for i in range(N-1):
            if A[i] + 1 < A[i+1]:
                foo  = 1
                break
        return foo

if IsNotPossible(A):
    print(-1)
    
else:
    count = 0
    for i in range(N-1):
        a = A[N-1-i]
        
        if a == 0:
            continue
        elif a == A[N-2-i] + 1:
            count += 1
        else:
            count += a
            
    print(count)

Fixed submission:
line = input().split()

A = int( line[0] )
B = int( line[1] )
C = int( line[2] )
K = int( line[3] )

if K % 2 == 0:
    print(A-B)
    
else:
    print(B-A)

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

N = int(line)
A = np.array([0]*N)

for i in range(N):
    line = input()
    A[i] = int(line)

def IsNotPossible(A):
    foo = 0
    
    if A[0] != 0:
        foo = 1
        
    else:
        for i in range(N-1):
            if A[i] + 1 < A[i+1]:
                foo  = 1
                break
    
    return foo

if IsNotPossible(A):
    print(-1)
    
else:
    count = 0
    for i in range(N-1):
        a = A[N-1-i]
        
        if a == 0:
            continue
        elif a == A[N-2-i] + 1:
            count += 1
        else:
            count += a
            
    print(count)

Fixed submission:
line = input().split()

A = int( line[0] )
B = int( line[1] )
C = int( line[2] )
K = int( line[3] )

if K % 2 == 0:
    print(A-B)
    
else:
    print(B-A)
Buggy python submission (verdict: Runtime Error):
line = input()

N = int(line)
A = np.array([0]*N)

for i in range(N):
    line = input()
    A[i] = int(line)

    
def IsNotPossible(A):
    for i in range(N): 
        ai = A[i]

        if ai > i:
            return 1

        for j in range(ai):
            if A[i-1-j] < ai-1-j:
                return 1

    return 0

if IsNotPossible(A):
    print(-1)
    
else:
    count = 0
    for i in range(N-1):
        a = A[N-1-i]
        
        if a == 0:
            continue
        elif a == A[N-2-i] + 1:
            count += 1
        else:
            count += a
            
    print(count)

Fixed submission:
def main():

    N = int(input())
    a = int(input())
    A = [a]

    if a != 0:
        return -1

    else:
        for i in range(N-1):
            a_ = int(input())
            if a_ > a + 1:
                return -1

            else:
                a =  a_
                A.append(a)
            
        count = 0
        for i in range(N-1):
            a = A[N-1-i]
        
            if a == 0:
                continue
            elif a == A[N-2-i] + 1:
                count += 1
            else:
                count += a
                
        return count

print(main())
Buggy python submission (verdict: Time Limit Exceeded):

def main():
    n = int(input())
    a_list = list(map(int, input().split()))

    a_list = list(filter((1).__ne__, a_list))

    if 0 in a_list:
        print('0')
        return

    result = 1

    for a in a_list:
        result = result * a

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

    print(result)


if __name__ == "__main__":
    main()


Fixed submission:

def main():
    n = int(input())
    a_list = list(map(int, input().split()))

    a_list = list(filter((1).__ne__, a_list))

    if 0 in a_list:
        print('0')
        return

    result = 1

    for a in a_list:
        result = result * a

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

    print(result)


if __name__ == "__main__":
    main()

Buggy python submission (verdict: Time Limit Exceeded):

def main():
    n = int(input())
    a_list = list(map(int, input().split()))

    if 0 in a_list:
        print('0')
        return

    result = 1

    for a in a_list:
        result = result * a

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

    print(result)


if __name__ == "__main__":
    main()


Fixed submission:

def main():
    n = int(input())
    a_list = list(map(int, input().split()))

    a_list = list(filter((1).__ne__, a_list))

    if 0 in a_list:
        print('0')
        return

    result = 1

    for a in a_list:
        result = result * a

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

    print(result)


if __name__ == "__main__":
    main()

Buggy python submission (verdict: Time Limit Exceeded):

def main():
    n = int(input())
    a_list = map(int, input().split())

    result = 1

    for a in a_list:
        result = result * a

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

    print(result)


if __name__ == "__main__":
    main()


Fixed submission:

def main():
    n = int(input())
    a_list = list(map(int, input().split()))

    a_list = list(filter((1).__ne__, a_list))

    if 0 in a_list:
        print('0')
        return

    result = 1

    for a in a_list:
        result = result * a

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

    print(result)


if __name__ == "__main__":
    main()

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


def main():
    n = int(input())
    a_list = map(int, input().split())

    result = reduce(lambda a1, a2: a1*a2, a_list)

    if result > 10**18:
        result = -1
    
    print(result)
    

if __name__ == "__main__":
    main()


Fixed submission:

def main():
    n = int(input())
    a_list = list(map(int, input().split()))

    a_list = list(filter((1).__ne__, a_list))

    if 0 in a_list:
        print('0')
        return

    result = 1

    for a in a_list:
        result = result * a

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

    print(result)


if __name__ == "__main__":
    main()
Buggy python submission (verdict: Time Limit Exceeded):
a, b, c, k = list(map(int, input().split()))

card_list = [1 for _ in range(a)] + [0 for _ in range(b)] + [-1 for _ in range(c)] 

print(sum(card_list[:k]))

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

if a >= k:
    print(k)
elif a + b >= k:
    print(a)
else:
    print(a - (k - (a + b)))
Buggy python submission (verdict: Time Limit Exceeded):
input_line1 = input()
input_line2 = input()

n = int(input_line1)
a_list = list(map(int, input_line2.split()))

for i in range(0, n):
    print(a_list[i:].count(i+1))


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

a_list = list(map(int, input_line2.split()))

counts = [0 for i in range(n)]

for i in range(len(a_list)):
    counts[a_list[i]-1] += 1

for c in counts:
    print(c)
Buggy python submission (verdict: Runtime Error):
N = int(input())
S = input()

sum_W = [0] * (N+1)
sum_E = [0] * (N+1)

for i in range(N):
    if S[i] == "W":
        sum_W[i+1] = sum_W[i] + 1
        sum_E[i+1] = sum_E[i]
    else:
        sum_W[i+1] = sum_W[i]
        sum_E[i+1] = sum_E[i] + 1

answers = []
for i in range(N):
    answer = sum_W[i] + (sum_E[N+1] - sum_E[i+1])
    answers.append(answer)

print(min(answers))

Fixed submission:
N=int(input())
S=input()
cnt=S.count("E")
m=cnt
for i in S:
    if i=="E":
        cnt-=1
    else:
        cnt+=1
    m=min(m,cnt)
print(m)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
S = input()

counts = []

for n in range(N):
    count = 0
    for s in S[0:n]:
        if s == "W":
            count += 1
    for s in S[n+1:]:
        if s == "E":
            count += 1
    counts.append(count)

print(min(counts))

Fixed submission:
N=int(input())
S=input()
cnt=S.count("E")
m=cnt
for i in S:
    if i=="E":
        cnt-=1
    else:
        cnt+=1
    m=min(m,cnt)
print(m)
Buggy python submission (verdict: Time Limit Exceeded):
a, b, x = [int(_) for _ in input().split()]

count = 0

for n in range(a, b+1):
    if (n % x) == 0:
        count += 1

print(count)

Fixed submission:
a, b, x = [int(_) for _ in input().split()]

count = b//x - a//x

if a%x == 0:
    count += 1

print(count)
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
l = list(map(int,input().strip().split()))[:n] 
rs= 1
for i in range(n):
    rs=l[i]*rs
    if rs>10**18:
        rs = -1
print(rs)

Fixed submission:
n=int(input())
l = list(map(int,input().strip().split()))[:n] 
rs= 1
l.sort()
if l[0]==0 :
    rs=0
else:
    for i in range(n):
        if(10**18 // rs < l[i]):
            rs = -1
            break
        rs=l[i]*rs
print(rs)
Buggy python submission (verdict: Runtime Error):
loop = int(input())
ac = 0
wa = 0
tle =0
re = 0

for _ in range(loop):
  judge = input()
  if judge == 'AC':
    ac += 1
  elif judge == 'WA':
    wa += 1
  elif judge == 'TLE':
  	tle += 1
  elif judge == 'RE':
    
print('AC × {}'.format(ac))
print('WA × {}'.format(wa))
print('TLE × {}'.format(tle))
print('RE × {}'.format(re))

Fixed submission:
loop = int(input())
ac = 0
wa = 0
tle =0
re = 0

for _ in range(loop):
  judge = input()
  if judge == 'AC':
    ac += 1
  elif judge == 'WA':
    wa += 1
  elif judge == 'TLE':
  	tle += 1
  elif judge == 'RE':
    re += 1
    
print('AC x {}'.format(ac))
print('WA x {}'.format(wa))
print('TLE x {}'.format(tle))
print('RE x {}'.format(re))
Buggy python submission (verdict: Runtime Error):
a = list(input())
b = list(input())

for i,con in enumerate(b):
  if i == a[i]:
    break
  else:
    count+=1
print(count)
    
  

Fixed submission:
a = list(input())
b = list(input())
count = 0

for i in range(len(b)):
  if b[i] != a[i]:
  	count+=1
    
print(count)
Buggy python submission (verdict: Runtime Error):
a,b = input()
listA = list(map(int,input().split()))
listA.sort()
all = 0

for i in range(b):
  all = all + list[i]

print(all)

Fixed submission:
a,b = map(int,input().split())
listA = list(map(int,input().split()))
listA.sort()
all = 0

for i in range(b):
  all = all + listA[i]

print(all)
Buggy python submission (verdict: Runtime Error):
a = int(input())
c = b.split()
a = c[-1]
if a ==2 or a== 4 or a==5 or a== 7 or a== 9:
	print("hon")
elif a == 0 or a== 1 or a==6 or a == 8:
	print("pon")
else:
  print("bon")

Fixed submission:
b = int(input())
a = b % 10
if a ==2 or a== 4 or a==5 or a== 7 or a== 9:
	print("hon")
elif a == 0 or a== 1 or a==6 or a == 8:
	print("pon")
else:
  print("bon")

Buggy python submission (verdict: Runtime Error):
a = int(input())
c = b.split('')
a = c[-1]
if a ==2 or a== 4 or a==5 or a== 7 or a== 9:
	print("hon")
elif a == 0 or a== 1 or a==6 or a == 8:
	print("pon")
else:
  print("bon")


Fixed submission:
b = int(input())
a = b % 10
if a ==2 or a== 4 or a==5 or a== 7 or a== 9:
	print("hon")
elif a == 0 or a== 1 or a==6 or a == 8:
	print("pon")
else:
  print("bon")

Buggy python submission (verdict: Runtime Error):
a = int(input())
c = b.split('')
a = c[-1]
if (a ==2 || a== 4 || a==5 || a== 7 || a== 9){
	print("hon")
}else if(a == 0 || a== 1 || a==6 || a == 8){
	print("pon")
}else {
  print("bon")
}

Fixed submission:
b = int(input())
a = b % 10
if a ==2 or a== 4 or a==5 or a== 7 or a== 9:
	print("hon")
elif a == 0 or a== 1 or a==6 or a == 8:
	print("pon")
else:
  print("bon")

Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
a,b,c = int(input())
if (c == 2 || c== 4 || c==5 || c ==7 || c==9){
	print("hon")
}else if(c == 0 || c== 1 || c==6 || c ==8){
	print("pon")
}else {
  print("bon")
}

Fixed submission:
b = int(input())
a = b % 10
if a ==2 or a== 4 or a==5 or a== 7 or a== 9:
	print("hon")
elif a == 0 or a== 1 or a==6 or a == 8:
	print("pon")
else:
  print("bon")

Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
b = int(input())
c = b.split('')
a = c[-1]
if (a == '2' || a== '4' || a=='5' || a == '7' || a == '9'){
	print("hon")
}else if(a == '0' || a== '1' || a=='6' || a == '8'){
	print("pon")
}else {
  print("bon")
}

Fixed submission:
b = int(input())
a = b % 10
if a ==2 or a== 4 or a==5 or a== 7 or a== 9:
	print("hon")
elif a == 0 or a== 1 or a==6 or a == 8:
	print("pon")
else:
  print("bon")