qyliang/CodeNanoFix huggingface dataset:
Buggy code:
n = int(input())
can = False
for i in range(1, n + 1):
    if(i * 1.08 == n):
        print(i)
        can = True
        break
if(can == False):
    print(":(")


Fixed code:
n = int(input())
can = False
for i in range(1, n + 1):
    x = int(i * 1.08)
    if(x == n):
        print(i)
        can = True
        break
if(can == False):
    print(":(")
Buggy code:
s =int(input())
if s % 25 == 0 or s % 25 == 13:
    print(':(')
else:
    print(-s * 25 // 27 * (-1))

Fixed code:
s =int(input())
if s % 27 == 13 or s % 27 == 26:
    print(':(')
else:
    print((-s * 25 // 27) * (-1))
Buggy code:
n = int(input())
import math
for i in range(50000):
  if math.floor(i*1.08) == n:
    print(i)
    exit()
    
ptiny(":(")

Fixed code:
n = int(input())
import math

for i in range(50000):
  if math.floor(i*1.08) == n:
    print(i)
    exit()
    
print(":(")
Buggy code:
import math
import sys
readline = sys.stdin.readline


def main():
    n = int(readline().rstrip())

    for i in range(50001):
        k = math.floor(i * 1.08)
        if n == k:
            print(i)
            break


if __name__ == '__main__':
    main()


Fixed code:
import math
import sys
readline = sys.stdin.readline


def main():
    n = int(readline().rstrip())

    for i in range(50001):
        k = math.floor(i * 1.08)
        if n == k:
            print(i)
            return
    print(':(')


if __name__ == '__main__':
    main()
Buggy code:
N = int(input())

for i in range(1, N):
  if i + i * 8 // 100 == N:
    print(i)
else:
  print(":(")
    

Fixed code:
N = int(input())
 
for i in range(1, N + 1):
  if i + (i * 8) // 100 == N:
    print(i)
    break
else:
  print(":(")
Buggy code:
n=int(input())
for i in range(n+1):
	if int(i*1.08)==n:
  	print(i)
    exit()
print(':(')

Fixed code:
n=int(input())
for i in range(n+1):
    if int(i*1.08)==n:
        print(i)
        exit()
print(':(')
Buggy code:
def main():
    from math import ceil
    N = int(input())
    X = ceil(N/1.08)
    if X*1.08 == N:
        print(X)
    else:
        print(":(")


if __name__ == '__main__':
    main()


Fixed code:
def main():
    from math import ceil, floor
    N = int(input())
    X = ceil(N/1.08)
    if floor(X*1.08) == N:
        print(X)
    else:
        print(":(")


if __name__ == '__main__':
    main()
Buggy code:
import math
n = int(input())

if(n%1.08>0 and n%1.08<0.1):
    print(":(")
else:
    print(math.floor(n/1.08))

Fixed code:
import math
n = int(input())

if(n%1.08>0 and n%1.08<0.1):
    print(":(")
else:
    print(math.ceil(n/1.08))
Buggy code:
n=int(input())

x=n//1.08

if (x+1)*1.08//1==n:
    print(x+1)
else:
    print(":(")


Fixed code:
n=int(input())
 
x=n//1.08
 
if (x+1)*1.08//1==n:
    print(int(x+1))
else:
    print(":(")
Buggy code:
n = int(input())

ans = 0

for i in range(100):
    val = 100 * n + i
    print(val, i)
    if val % 108 == 0:
        ans = val // 108
        break
    else:
        pass

print(':(') if ans == 0 else print(ans)


Fixed code:
n = int(input())

ans = 0

for i in range(100):
    val = 100 * n + i
    if val % 108 == 0:
        ans = val // 108
        break
    else:
        pass

print(':(') if ans == 0 else print(ans)
Buggy code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

n = int(input())

def binary_search(ok, ng, cond):
    while abs(ok - ng) > 1:
        mid = (ok + ng) / 2
        if cond(mid):
            ok = mid
        else:
            ng = mid
    return ok

candidate = binary_search(n, 0, lambda x: x * 1.08 >= n)
if n == int(candidate * 1.08):
    print(candidate)
else:
    print(':(')


Fixed code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

n = int(input())

def binary_search(ok, ng, cond):
    while abs(ok - ng) > 1:
        mid = (ok + ng) // 2
        if cond(mid):
            ok = mid
        else:
            ng = mid
    return ok

candidate = binary_search(n, 0, lambda x: x * 1.08 >= n)
if n == int(candidate * 1.08):
    print(candidate)
else:
    print(':(')
Buggy code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

n = int(input())

def bs(ok, ng, solve):
    while abs(ok - ng) > 1:
        mid = (ok + ng) // 2
        if solve(mid):
            ok = mid
        else:
            ng = mid
    return ok

ans = bs(n, 0, lambda x: x * 1.08 >= n)
if ans * 1.08 == n:
    print(ans)
else:
    print(':(')


Fixed code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

n = int(input())

def bs(ok, ng, cond):
    while abs(ok - ng) > 1:
        mid = (ok + ng) // 2
        if cond(mid):
            ok = mid
        else:
            ng = mid
    return ok

ans = bs(n, 0, lambda x: (x * 1.08) >= n)
if int(ans * 1.08) == n:
    print(ans)
else:
    print(':(')
Buggy code:
import sys

def main():
    N=int(input())

    for x in range(50001):
        if(int(x*1.08)==N):
            print(x)
            sys.exit()

main()

Fixed code:
import sys

def main():
    N=int(input())

    for x in range(50001):
        if(int(x*1.08)==N):
            print(x)
            sys.exit()

    print(":(")
main()
Buggy code:
import math

n = int(input())

x = n/1.08

x = round(x)

print(x)

m = math.floor(x * 1.08)

print(m)

if n != m:
    print(":(")
else:
    print(x) 

Fixed code:
import math

n = int(input())

x = round(n/1.08)

m = math.floor(x * 1.08)

if n != m:
    x=x+1
    m = math.floor(x * 1.08)
    if n != m:
        print(":(")
    else:
        print(x) 
else:
    print(x)
Buggy code:
# coding: utf-8
# Your code here!
n=int(input())
ans=":("

for i in range(50000):
    if i*1.08==n:
        ans=i

print(ans)
    


Fixed code:
# coding: utf-8
# Your code here!
n=int(input())
ans=":("

for i in range(50000):
    if int(i*1.08)==n:
        ans=i

print(ans)
Buggy code:
n = int(input())
for i in range(50000):
    x = int(i * 1.08)
    if (n == x):
        print(float(i))
        exit()
print(':(')


Fixed code:
n = int(input())
for i in range(50000):
    x = int(i * 1.08)
    if (n == x):
        print(i)
        exit()
print(':(')
Buggy code:
X = int(input())
ans = X//1.08
if int(ans*1.08) == X:
  print(ans)
elif int((ans+1)*1.08) == X:
  print(ans+1)
else:
  print(':(')

Fixed code:
X = int(input())
ans = int(X/1.08)
if int(ans*1.08) == X:
  print(ans)
elif int((ans+1)*1.08) == X:
  print(ans+1)
else:
  print(':(')
Buggy code:
n = int(input())
for i in range(n):
  if i * 1.08 == n:
    print(i)
    exit()
print(":(")

Fixed code:
n = int(input())
for i in range(50001):
  if int(i * 1.08) == n:
    print(i)
    exit()
print(":(")
Buggy code:
import math

N = int(input()) 
ans = math.floor(N/1.08)
print(ans if ans * 1.08 == N else ":(")

Fixed code:
import math

N = int(input()) 
ans = math.ceil(N/1.08)
print(ans if math.floor(ans * 1.08) == N else ":(")
Buggy code:
N=int(input())
flg=False
ans=0
for n in range(1, N+1):
  if (int(1.08*n) == N):
    ans=n
    flg=True
if flg:
  print(n)
else:
  print(':(')


Fixed code:
N=int(input())
flg=False
ans=0
for n in range(1, N+1):
  if (int(1.08*n) == N):
    ans=n
    flg=True
if flg:
  print(ans)
else:
  print(':(')
Buggy code:
n = int(input())
stp = int(N/1.08)
while True:
  cost = int(stp*1.08)
  if cost == n:
    ans = cost
    break
  elif cost > n:
    ans = '):'
    break
  else:
    stp += 1
print(ans)

Fixed code:
n = int(input())
stp = int(n/1.08)
while True:
  cost = int(stp*1.08)
  if cost == n:
    ans = stp
    break
  elif cost > n:
    ans = ':('
    break
  else:
    stp += 1
print(ans)
Buggy code:
import math
n = int(input())

a = math.floor(n / 1.08)
b = a + 1

aa = a * 1.08
bb = b * 1.08
if (aa == n):
    print(a)
else:
    if (bb == n):
        print(b)
    else:
        print(':(')


Fixed code:
import math
n = int(input())

a = math.floor(n / 1.08)
b = a + 1

aa = math.floor(a * 1.08)
bb = math.floor(b * 1.08)
if (aa == n):
    print(a)
else:
    if (bb == n):
        print(b)
    else:
        print(':(')
Buggy code:

N= int(input())
X1 = N / 1.08
X = int(X1)
N_calc = int(X*1.08)
N_calc2 = int((X+1)*1.08)
if N_calc == N or N_calc2==N:
    print(X)
else :
    print(":(")

Fixed code:
N= int(input())
X1 = N / 1.08
X = int(X1)
N_calc = int(X*1.08)
N_calc2 = int((X+1)*1.08)
if N_calc == N :
    print(X)
elif N_calc2==N:
    print(X+1)
else :
    print(":(")
Buggy code:
from math import floor

n=int(input())
x=floor(n/1.08)

if int(x*1.08) == n:
  print(x)
else:
  print(':(')

Fixed code:
from math import ceil
from math import floor
n = int(input())
x = n / 1.08
if floor(floor(x) * 1.08) == n:
    print(floor(x))
elif floor(ceil(x) * 1.08) == n:
    print(ceil(x))
else:
    print(':(')
Buggy code:
N=int(input())

a=int(N*100/110)-1

flg=False

for i in range (N-a):
    if (a*1.08)//1==N:
        print(a+i)
        exit
    else:
        pass
print(':(')

Fixed code:
# N=1079
N=int(input())

a=int(N*100/110)-1

flg=False

for i in range (N-a+1):
    if ((a+i)*1.08)//1==N:
        print(a+i)
        exit()
    else:
        pass
print(':(')
Buggy code:
N = int(input())
n = int(N/1.08)
if int(n * 1.08) != N and N!=int( (n+1) * 1.08):
    print(':(')
else:
    print(n)

Fixed code:
N = int(input())
n = int(N/1.08)
if (int(n * 1.08) < N and N < int((n+1) * 1.08)):
    print(':(')
else:
    print(int(N//1.08)+1)
Buggy code:
n=int(input())

ans = 0
for i in range(n):
    if int(i*1.08)==n:
        ans = i
        break
print(ans) if ans!=0 else ':('

Fixed code:
n=int(input())

ans = 0
for i in range(n+1):
    if int(i*1.08)==n:
        ans = i
        break
if ans!=0:
    print(ans) 
else:
    print(':(')
Buggy code:
n = int(input())
a = int(n/1.08)
if int(a*1.08) == n:
  print(a)
elif int((a+1)*1.08) == n:
  print(a+1)
else:
  (':(')

Fixed code:
n = int(input())
a = int(n/1.08)
if int(a*1.08) == n:
  print(a)
elif int((a+1)*1.08) == n:
  print(a+1)
else:
  print(':(')
Buggy code:
X = int(input())

for i in range(50000):
  if int(i*1.05) == X:
    print(i)
    break
else:
  print(':(')

Fixed code:
X = int(input())

for i in range(50000):
  if int(i*1.08) == X:
    print(i)
    break
else:
  print(':(')
Buggy code:
import sys
from math import ceil, floor
def main():
    n = int(sys.stdin.readline().rstrip())
    x = ceil(n * 1.08)
    if floor(x * 1.08) == n:
        print(x)
    else:
        print(':(')
if __name__ == '__main__':
    main()

Fixed code:
import sys
from math import ceil, floor
def main():
    n = int(sys.stdin.readline().rstrip())
    x = ceil(n * 100 / 108) 
    if floor(x * 1.08) == n:
        print(x)
    else:
        print(':(')
if __name__ == '__main__':
    main()
Buggy code:
N = int(input())
for i in range(1,101):
  tmp = int(i * 1.08)
  if(tmp == N):
    print(str(tmp))
    exit()
print(":(")

Fixed code:
N = int(input())
for i in range(1,50001):
  tmp = int(i * 1.08)
  if(tmp == N):
    print(str(i))
    exit()
print(":(")
Buggy code:
n=int(input())
x=n//1.08
if x%1==0:
  print(x)
elif (x+1)*1.08-n<1:
  print(x+1)
else:
  print(':(')

Fixed code:
n=int(input())
x=n/1.08
if x%1==0:
  print(int(x))
elif int((int(x)+1)*1.08)==n:
  print(int(x)+1)
else:
  print(':(')
Buggy code:
from math import floor, ceil


if __name__ == "__main__":
    n = int(input())

    ans = n * 100 // 108

    if (ans * 108) // 100 == n:
        print(ans)
    elif (ans * 108) // 100 + 1 == n:
        print(ans + 1)
    else:
        print(':(')


Fixed code:
from math import floor, ceil


if __name__ == "__main__":
    n = int(input())

    ans = n * 100 / 108

    if ceil(ans) * 108 // 100 == n:
        print(ceil(ans))
    elif floor(ans) * 108 // 100 == n:
        print(floor(ans))
    else:
        print(':(')
Buggy code:
import math
N=input()
a=math.ceil(N/1.08)
if math.floor(a*1.08) == N:
  print(a)
else:
  print(":(")

Fixed code:
import math
N=int(input())
a=math.ceil(N/1.08)
if math.floor(a*1.08) == N:
  print(a)
else:
  print(":(")
Buggy code:
import math
N = int(input())
for i in range(50001):
  if math.floor(i*1.08) == N:
    print(math.floor(i*1.08))
    exit()
else:
  print(":(")

Fixed code:
import math
N = int(input())
for i in range(1,50001):
  if math.floor(i*1.08) == N:
    print(i)
    exit()
else:
  print(":(")
Buggy code:
n = int(input())
ans = 0
for i in range(1, N+1):
    if int(i * 1.08) == n:
        ans = i

if ans == 0:
    print(":(")
else:
    print(x)

Fixed code:
n = int(input())
ans = 0
for i in range(1, n+1):
    if int(i * 1.08) == n:
        ans = i

if ans == 0:
    print(":(")
else:
    print(ans)
Buggy code:
import numpy as np
N = int(input())

x = N / 1.08
c = int(np.ceil(x))
f = int(np.floor(x))
if int(c * 1.08) == N:
  print(c)
elif int(f * 1.08) == N:
  print(f)
else:
  print(':('

Fixed code:
import numpy as np
N = int(input())

x = N / 1.08
c = int(np.ceil(x))
f = int(np.floor(x))
if int(c * 1.08) == N:
  print(c)
elif int(f * 1.08) == N:
  print(f)
else:
  print(':(')
Buggy code:
x = int(input())

b = x//1.08
x1 = int(b*1.08)
x2 = int((b+1)*1.08)

if x1 == x:
  print(b)
elif x2 == x:
  print(b+1)
else:
  print(-1)

Fixed code:
x = int(input())

b = int(x/1.08)
x1 = int(b*1.08)
x2 = int((b+1)*1.08)

if x1 == x:
  print(b)
elif x2 == x:
  print(b+1)
else:
  print(":(")
Buggy code:
import math
n = int(input())
a = math.floor(n / 1.08)
b = a + 1
c = math.floor(a * 1.08)
d = math.floor(b * 1.08)

if c == n:
  print(a)
elif b == d:
  print(b)
else:
  print(":(")

Fixed code:
import math
n = int(input())
a = math.floor(n / 1.08)
b = a + 1
c = math.floor(a * 1.08)
d = math.floor(b * 1.08)

if c == n:
  print(a)
elif d == n:
  print(b)
else:
  print(":(")
Buggy code:
N = int(input())

def solve(N):
    for i in range(60000):
        if int(i * 1.08) == N:
            print(i)
    else:
        print(":(")

solve(N)

Fixed code:
N = int(input())

def solve(N):
    for i in range(60000):
        if int(i * 1.08) == N:
            print(i)
            break
    else:
        print(":(")

solve(N)
Buggy code:
amount = int(input())
before_tax = int(amount / 1.08)
after_tax = before_tax + 1
print(after_tax, before_tax)
if int(after_tax * 1.08) == amount:
  print(int(after_tax))
elif int(before_tax * 1.08) == amount: 
  print(int(before_tax))
else:
  print(":(")

Fixed code:
amount = int(input())
before_tax = int(amount / 1.08)
after_tax = before_tax + 1
if int(after_tax * 1.08) == amount:
  print(int(after_tax))
elif int(before_tax * 1.08) == amount: 
  print(int(before_tax))
else:
  print(":(")
Buggy code:
n=int(input())
for i in range(1,50001):
    if i*1.08==n:
        print(i)
        exit()
print(":(")


Fixed code:
n=int(input())
for i in range(1,50001):
    if int(i*1.08)==n:
        print(i)
        exit()
print(":(")
Buggy code:
TAX = 1.08
value = int(input())

row_cost = int(value / TAX)

flag = False
if row_cost * TAX == value:
    flag = True

elif (row_cost + 1) * TAX == value:
    flag = True

else :
    flag = False

if flag:
    print(row_cost)
else:
    print(":(")



Fixed code:
TAX = 1.08
value = int(input())

row_cost = int(value / TAX)

flag = False
echo_cost = 0
if int(row_cost * TAX) == value:
    flag = True
    echo_cost = int(row_cost )
elif int((row_cost + 1) * TAX) == value:
    flag = True
    echo_cost = int(row_cost + 1)

else :
    flag = False

if flag:
    print(echo_cost)
else:
    print(":(")
Buggy code:
A=int(input())
B=(A*100)//108
print(((B+1)*1.08)//1)
if((((B*1.08)//1)==A) or ((((B+1)*1.08)//1)==A)):
    print(B)
else:
    print(":(")

Fixed code:
A=int(input())
B=(A*100)//108

if((((B*1.08)//1)==A)):
    print(B)
elif((((B+1)*1.08)//1)==A):
    print(B+1)
else:
    print(":(")
Buggy code:
import math
n = int(input())
x = n/1.08
x1, x2 = math.floor( x ), math.ceil( x )
print(x1, x2)

if n == math.floor( x1 * 1.08 ) :
  print(x1)
elif n == math.floor( x2 * 1.08 ):
  print(x2)
else:
  print(':(')

Fixed code:
import math
n = int(input())
x = n/1.08
x1, x2 = math.floor( x ), math.ceil( x )

if n == math.floor( x1 * 1.08 ) :
  print(x1)
elif n == math.floor( x2 * 1.08 ):
  print(x2)
else:
  print(':(')
Buggy code:
import math
n = int(input())
ok = False
for i in range(n-1,0,-1):
    if math.ceil(i*1.08)==n:
        print(i)
        ok = True
        break
if ok==False:
    print(":(")


Fixed code:
import math
n = int(input())
ok = False
for i in range(n,0,-1):
    if math.floor(i*1.08)==n:
        print(i)
        ok = True
        break
if ok==False:
    print(":(")
Buggy code:
import sys
n=int(input())
for i in range(n):
    if (i*108/100==n):
        print (i)
        sys.exit() 
print(":(")


Fixed code:
import sys
n=int(input())
for i in range(n+10):
    if (int(i*108/100)==n):
        print (i)
        sys.exit() 
print(":(")
Buggy code:
N = int(input())
s = []
for i in range(50000):
    s.append(int((i+1)*1.08))
if N in s:
    print(int(1001/1.08+1/1.08))
else:
    print(":)")

Fixed code:
N = int(input())
s = []
for i in range(50000):
    s.append(int((i+1)*1.08))
if N in s:
    print(int(N/1.08+1/1.08))
else:
    print(":(")
Buggy code:
n = int(input())

k = n*100/108
k = int(k)

ans = ":("
for i in range(-1,2):
  if n==int(k*1.08):
    ans = k+i
print(ans)

Fixed code:
n = int(input())

k = n*100/108
k = int(k)

ans = ":("
for i in range(k-1,k+2):
  if n==int(i*1.08):
    ans = i
print(ans)
Buggy code:
n = int(input())
r = (25*n + 24)//27
print((r, ':')[r * 27 < n])


Fixed code:
n = int(input()) * 25
r = (n + 24)//27
print((r, ':(')[r * 27 < n])
Buggy code:
n = int(input())
if n//1.08 * 1.08 == n:
  print(n//1.08)
else (n//1.08+1)*1.08 == n:
  print(n//1.08+1)
else:
  print(":(")

Fixed code:
n = int(input())

if (n//1.08 + 1)*1.08 // 1 == n:
  print(int(n//1.08 + 1))
else:
  print(":(")
Buggy code:
n=int(input()) 
flag == False
for i in range(100*n,100*(n+1)):
  if i%108 == 0:
    x == int(i//108)
    print(x)
    flag == True
    break
if flag == False:
  print(':(')
  

Fixed code:
n=int(input()) 
flag = False
for i in range(100*n,100*(n+1)):
  if i%108 == 0:
    x = int(i//108)
    print(x)
    flag = True
    break
if flag == False:
  print(':(')
Buggy code:
import math
N=int(input())
X=float(N)/1.08
if X%1==0.0:
    print(int(X))
else:
    Y=math.floor(X)
    if math.floor(Y*1.08)==N or math.floor((Y-1)*1.08)==N or math.floor((Y+1)*1.08)==N:
        print(Y)
    else:
        print(":(")

Fixed code:
import math
N=int(input())
X=float(N)/1.08
if X%1==0.0:
    print(int(X))
else:
    Y=math.floor(X)
    if math.floor(Y*1.08)==N:
        print(Y)
    elif math.floor((Y+1)*1.08)==N:
        print(Y+1)
    elif math.floor((Y-1)*1.08)==N:
        print(Y-1)
    else:
        print(":(")
Buggy code:
import math

n = float(input())

x1 = n/1.08
x2 = (n+1)/1.08
x3 = int(math.floor(x1))

if x3 < x2:
	print(x3)
else:
	print(":(")

Fixed code:
import math

n = float(input())

x1 = n/1.08
x2 = (n+1)/1.08
x3 = int(math.ceil(x1))

if x3 < x2:
	print(x3)
else:
	print(":(")
Buggy code:
N=int(input())
a=math.ceil(N/1.08)
b=math.floor(a*1.08)
print(a if N==b else ":(")

Fixed code:
import math
N=int(input())
a=math.ceil(N/1.08)
b=math.floor(a*1.08)
print(a if N==b else ":(")
Buggy code:
import math
N = int(input())
kari = N*100/108
hako = math.ceil(kari)
ans = math.floor(kari)
if  hako*108/100==N or ans*108/100==N:
    print(kari)
elif math.floor(hako*108/100)==N:
    print(hako)
elif math.floor(ans*108/100)==N:
    print(ans)
else:
    print(":(")

Fixed code:
import math
N = int(input())
kari = N*100/108
hako = math.ceil(kari)
ans = math.floor(kari)
if  hako*108/100==N or ans*108/100==N:
    print(math.floor(kari))
elif math.floor(hako*108/100)==N:
    print(hako)
elif math.floor(ans*108/100)==N:
    print(ans)
#elif math.ceil(hako*108/100)==N:
 #   print(hako)
#elif math.ceil(ans*108/100)==N:
 #   print(ans)
else:
    print(":(")
Buggy code:
import math
from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
a = int(input())
x = a/1.08
if not x.is_integer():
    b = math.ceil(x)
    c = math.floor(x)
    if round(c*1.08) == a:
        print(c)
    elif round(b*1.08) == a:
        print(b)
    else:
        print(":(")
else:
    if round(x*1.08) == a:
        print(int(x))
    else:
        print(":(")

Fixed code:
import math
from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
a = int(input())
x = a/1.08
if not x.is_integer():
    b = math.ceil(x)
    c = math.floor(x)
    if int(c*1.08) == a:
        print(c)
    elif int(b*1.08) == a:
        print(b)
    else:
        print(":(")
else:
    if int(x*1.08) == a:
        print(int(x))
    else:
        print(":(")
Buggy code:
N = int(input())

X = N//1.08
for n in range(10):
    X += n
    if X*1.08 == N:
        print(X)
        exit(0)
print(":(")


Fixed code:
N = int(input())

X = N//1.08
for n in range(10):
    X += n
    if int(X*1.08) == N:
        print(int(X))
        exit(0)
print(":(")
Buggy code:
from math import ceil,floor
n=int(input())
if int (floor(ceil(n/1.08)*1.08 ))==n:
    print (floor(n/1.08))
else:
    print (":(")


Fixed code:
from math import ceil,floor
n=int(input())
if int (floor(ceil(n/1.08)*1.08 ))==n:
    print (ceil(n/1.08))
else:
    print (":(")
Buggy code:
n=int(input())
val=0
ans=0
for i in range(int(n//1.08)-2,int(n//1.08)+3):
	if i*1.08//1==n:
		ans=i
		val=1
print(': (' if val==0 else ans)

Fixed code:
n=int(input())
val=0
ans=0
for i in range(int(n//1.08)-2,int(n//1.08)+3):
	if i*1.08//1==n:
		ans=i
		val=1
print(':(' if val==0 else ans)
Buggy code:
n=int(input())
ans=:(
for i in range(1,n):
  if int((i*1.08)//1)==n:
    ans=i
    break
print(ans)

Fixed code:
n=int(input())
ans=':('
for i in range(1,n+1):
  if int((i*1.08)//1)==n:
    ans=i
    break
print(ans)
Buggy code:
n = int(input())

import.math

x = n / 1.08
m = math.floor(n * 1.08)

if m == n:
    print(x)
else:
    print(':(')


Fixed code:
n = int(input())

import math

x = math.ceil(n / 1.08)
m = math.floor(x * 1.08)

if m == n:
    print(int(x))
else:
    print(':(')
Buggy code:
X = int(input())
import math
ans = int((X/1.08)//1)

if math.floor(((X/1.08)//1)*1.08) != X:
  print(":(")
else:
  print(ans)

Fixed code:
X = int(input())
import math
ans = math.floor(math.ceil(X/1.08))

if math.floor(math.ceil(X/1.08)*1.08) != X:
  print(":(")
else:
  print(ans)
Buggy code:
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#solve
def solve():
    x = II()
    a = x / 1.08
    if a.is_integer():
        print(a)
    else:
        print(":(")
    return


#main
if __name__ == '__main__':
    solve()


Fixed code:
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#solve
def solve():
    x = II()
    for i in range(50000):
        if int(i * 1.08) == x:
            print(i)
            return
    print(":(")


#main
if __name__ == '__main__':
    solve()