peterverebics/CodeNet_Python_118 huggingface dataset:
N = int(input())

for X in range(1, N+1):
    if X*108//100==N:
        print(X)
        break
else:
    print(':(')
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(':(')
N = int(input())
for i in range(1,50001):
  tmp = int(i * 1.08)
  if(tmp == N):
    print(str(i))
    exit()
print(":(")
n=int(input())
ans=[]
for i in range(55000):
  if int(i*1.08)==n:
    ans.append(i)
if ans==[]:
  print(':(')
else:
  print(ans[0])
n = int(input())
x = int(n / 1.08 - 2)
for i in range(x, x + 4):
    if int(i * 108 // 100) == n:
        print(i)
        break
else:
    print(":(")
N = int(input())

ans = ':('
for i in range(N+1):
  if int(i * 1.08) == N:
    ans = i
    break
    
print(ans)
import math
N = int(input())
flag = True
for i in range(1,50001):
    if N == math.floor(i*1.08):
        print(i)
        flag = False
        break
if flag:
    print(':(')
n = int(input())

flag = False
ans = 0
for i in range(50001):
    if int(i * 1.08) == n:
        flag = True
        ans = i
        break
print(ans if flag else ":(")
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(':(')
import math
n = int(input())
r = ":("
for i in range(50000):
    if math.floor(i*1.08) == n:
        print(i)
        exit()
    if math.floor(i*1.08) > n:
        break
print(r)
import math

N = int(input())

X = math.ceil(N / 1.08)
print(X if math.floor(X*1.08)==N else ":(")
import math
def main():
    n = int(input())
    mn = math.floor(n/1.08)
    mx = math.floor((n+1)/1.08)+1
    for i in range(mn, mx):
        if math.floor(1.08*i) == n:
            print(i)
            return 0
    print(':(')

main()
import math

ans = -1
n = int(input())

for i in range(1, n+1):
    if math.floor(i * 1.08) == n:
        ans = i
        break

print(ans if ans != -1 else ":(")
import math
p = int(input())
d = math.floor(p / 1.08)
if(math.floor(d * 1.08) == p):
	print(d)
elif(math.floor((d+1) * 1.08) == p):
	print(d+1)
else:
	print(":(")
from math import ceil,floor
N=int(input())
n1=int(N/1.08)
n2=ceil(N/1.08)

if floor(n1*1.08)==N:
 print(n1)
elif floor(n2*1.08)==N:
 print(n2)
else:
 print(":(")
import math
n = int(input())

ans = math.ceil(n/1.08)
if math.floor(ans*1.08) == n:
    print(ans)
else:
    print(":(")
import math

N = int(input())

result = math.ceil(N / 1.08)

comfirm_result = int(result * 1.08)

if comfirm_result == N:
    print(result)
else:
    print(':(')
X = int(input())

if X % 1.08 == 0:
    print(int(X//1.08))
else:
    if int((int(X//1.08)+1) * 1.08) == X:
        print(int(X//1.08+1))
    else:
        print(":(")
N=int(input())

c=1
for i in range(1,50001):
    if int(i*1.08)==N:
        c=0
        print(i)
        
if c==1:
    print(":(")
import math
x = int(input())
ans = math.ceil(x/1.08)
if x == math.floor(ans * 1.08):
    print(ans)
else:
    print(":(")
import sys
n = int(input())
for i in range(1,n+1):
    if int(i*1.08) == n:
        print(i)
        sys.exit()

print(":(")
import math
N=int(input())

min = N/1.08
max = (N+1)/1.08

candidate = math.ceil(min)
if candidate >= max:
    print(':(')
else:
    print(candidate)
import math

N = int(input())

n = N / (1.08)

n0 = math.floor(n) - 1
n1 = math.floor(n)
n2 = math.ceil(n)

if int(n0 * 1.08) == N:
    print(n0)
elif int(n1 * 1.08) == N:
    print(n1)
elif int(n2 * 1.08) == N:
    print(n2)
else:
    print(":(")
n = int(input())
p = 0
for i in range(n+1):
    if int(i * 1.08) == n:
        print(i)
        p = 1
        break
if p == 0:
    print(':(')
n = int(input())

for i in range(50001):
	if n == int(i*1.08):
		print (i)
		exit()
print (":(")
#方法２
import math
n = int(input())

if math.floor(math.ceil(n/1.08) * 1.08) == n:
    print(math.ceil(n/1.08))
else:
    print(':(')
n=int(input())

dic={}
for i in range(1,50001):
    p=int(i*1.08)
    dic[p]=i
if n in dic:
    print(dic[n])
else:
    print(":(")
N = int(input())

for i in range(1, 50001):
    if int(1.08 * i) == N:
        print(i)
        break
else:
    print(":(")
import math
import sys
n = int(input())
found = False

if(n <= 12):
    print(n)
    sys.exit()

for y in range(n):
    if n == math.floor(y*1.08):
        print(y)
        found = True
        break
if (found == False):
    print(":(")
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(':(')
N=int(input())
for i in range(1,500001):
    if int(i*1.08)==N:
        print(i)
        break
else:
      print(':(')
N = int(input())
flag = True
for i in range(N, 0, -1):
  if int(i*1.08) == N:
    print(i)
    flag = False
    break
if flag:
  print(':(')
# coding: utf-8

import math

n = int(input())
n_max = 46298

for i in range(1, n_max):
    x = math.floor(i * 1.08)
    if x == n:
        print(i)
        exit()

print(':(')
n = int(input())
for i in range(50000):
    tmp=i*1.08//1
    if tmp==n:
        print(i)
        exit(0)
print(":(")
n = int(input())
ans = ":("
for i in range(1, 50001):
    if (i*1.08)//1 == n:
        ans = i
        break
print(ans)
n = int(input())
for x in range(int(n / 1.1), n + 1):
    if int(x * 1.08) == n:
        print(x)
        exit(0)
print(':(')
n=int(input())

x=int(n/1.08)

if int(x*1.08)==n:
    print(x)
elif int((x+1)*1.08)==n:
    print(x+1)
else:
    print(':(')
import sys
N = int(input())
for n in range(1, N + 1):
    if int(n * 1.08) == N:
        print(n)
        sys.exit()
print(":(")
import math
N = int(input())
nuki = math.ceil(N/1.08)
print(nuki if math.floor(nuki*1.08) == N else ':(')
N = int(input())

for x in range(50000):
    if x * 108 // 100 == N:
        print(x)
        break
else:
    print(':(')
n = int(input())
ans = ":("
for i in range(1,50001):
    if (i*1.08)//1 == n:
        ans = i
        break
print(ans)
n = int(input())
res = 0
for i in range(50001):
  if int(i * 1.08) == n:
    res = i
if res != 0:
  print(res)
else:
  print(':(')
import math

N = int(input())

low = N // 1.08

while True:
    if math.floor(low * 1.08) == N:
        print(int(low))
        break
    elif math.floor(low * 1.08) > N:
        print(':(')
        break
    low += 1
N = int(input())
t = int(N / 1.08)
while True:
    if int(t*1.08) == N:
        print(t)
        break
    if int(t*1.08) > N:
        print(":(")
        break
    t += 1
import math

n = int(input())
X = math.ceil(n / 1.08)

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

if N * 100 % 108 == 0:
    print(int(N / 1.08))
else:
    if int(N // 1.08 * 1.08) == N:
        print(int(N / 1.08))
    elif int((N // 1.08 + 1) * 1.08) == N:
        print(int(N / 1.08) + 1)
    else:
        print(":(")
import math
N = int(input())
X = N / 1.08

floor = math.ceil(N/1.08)
ceil = math.ceil((N+1)/1.08)

for i in range(floor,ceil):
    print(i)
    break
else:
    print(":(")
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')
MOD = 10**9+7


def main():
  N = int(readline())
  for i in range(50000):
    a = int(i*1.08)
    if a == N:
      print(i)
      break
    else:
      continue
  else:
    print(':(')
  
  
  
if __name__ == '__main__':
  main()
n = int(input())
for i in range(10**6):
    if int(i*1.08) == n:
        print(i)
        exit()
print(':(')
n = int(input())
import math

for i in range(50000):
  if math.floor(i*1.08) == n:
    print(i)
    exit()
    
print(":(")
import math
N = int(input())
X_MAX = int(math.ceil(50000 / 1.08))

ans = ':('
for i in range(X_MAX + 1):
    if int(i * 1.08) == N:
        ans = i
        break

print(ans)
n = int(input())

for i in range(1, 50001):
    if int(i*1.08) == n:
        print(i)
        exit()
print(":(")
import sys
import math
import numpy as np
input = sys.stdin.readline

N = int(input())
X = math.ceil(N / 1.08)
if math.floor(X * 1.08) == N:
    print(X)
else:
    print(':(')
n = int(input())

for i in range(n+1):
    if int(i * 1.08) == n:
        print(i)
        exit()
print(":(")
import math

N = int(input())

X = math.ceil(N / 1.08)

if math.floor(X * 1.08) == N:
    print(X)
else:
    print(":(")
n = int(input())
found = False

for i in range(1, n + 1):
    x = int ( i * 1.08 )
    if x == n :
        print(i)
        found = True
        break

if not found:
    print(":(")
N = int(input())
X = N // 1.08
result1 = int(X) * 1.08
result2 = (int(X)+1) * 1.08
result3 = (int(X)-1) * 1.08

if int(result1) == N:
  result = int(X)
elif int(result2) == N:
  result = int(X) + 1
elif int(result3) == N:
  result = int(X) -1
else:
  result = ':('

print(result)
N = int(input())
ans = ":("
for X in range(1, 5*10**4+1):
  if int(X * 1.08) == N:
    ans = X
    break
print(ans)
import numpy as np

N = int(input())
X_low = N // 1.08
X_high = int(X_low + 1)

if np.floor(X_low * 1.08) == N:
    print(X_low)
elif np.floor(X_high * 1.08) == N:
    print(X_high)
else:
    print(':(')
# 三井住友信託銀行プログラミングコンテスト2019: B – Tax Rate
N = int(input())

X = int(N / 1.08)
X_min = int(X * 1.08)
X_max = int((X + 1) * 1.08)

if X_min == N:
    print(X)
elif X_max == N:
    print(X + 1)
else:
    print(':(')
N = int(input())
n = int(N // 1.08)

while n <= N:
    if int(n * 1.08) == N:
        print(n)
        exit()

    n += 1

print(':(')
N = int(input())

for ans in range(1, 46298):
  if int(ans * 1.08) == N:
    print(ans)
    break
else:
  print(":(")
from math import ceil
from sys import stdin
N = int(stdin.readline().rstrip())
ans = ceil(N / 1.08)
if int(ans * 1.08) == N:
    print(ans)
else:
    print(':(')
t = int(input())
for n in range(50001):
    if int(n*1.08) == t:
        print(n)
        exit()
print(":(")
n = int(input())
import math
f = False
for i in range(100000):
    if math.floor(i * 1.08) == n:
        print(i)
        f = True
        break
if f is False:
    print(":(")
N = int(input())

N_1 = round(N/1.08//1)
N_2 = N_1 + 1


if N_1*1.08//1 == N:
    print(N_1)

elif N_2 * 1.08//1 == N:
    print(N_2)

else:
    print(":(")
import math
n = float(input())
a = math.floor(n/1.08)
x = []
if math.floor((a)*1.08) == n:
  print(a)
elif math.floor((a+1)*1.08) == n:
  print(a+1)
elif math.floor((a+2)*1.08) == n:
  print(a+2)
elif math.floor((a+3)*1.08) == n:
  print(a+3)
elif math.floor((a-1)*1.08) == n:
  print(a-1)
else:
  print(":(")
from math import floor
N = int(input())

for x in range(1, 50001):
    if floor(x * 1.08) == N:
        print(x)
        break
else:
    print(":(")
import math
N = int(input())
ans = math.ceil(100*N/108)
if math.floor(ans*1.08) == N:
    print(ans)
else:
    print(":(")
A=int(input())
for i in range(1,50000):
    if int(i * 1.08) == A:
        print(i)
        exit()
print(":(")
N = int(input())

ans = (N * 100 + 99) // 108

if N==int(ans*1.08):
  print(ans)
else:
  print(':(')
def main():
    from decimal import Decimal
    x = Decimal(input())
    for i in range(60000):
        if int(Decimal(i)*Decimal('1.08'))==x:
            return i
    return ':('
print(main())
n=int(input())
for x in range(n+1):
  if int(x*1.08)==n:
    print(x)
    break
else:
  print(':(')
import math

n = int(input())

m = math.floor((n+1)/1.08)
l = math.floor(m*1.08)

if n==l:
    print(m)
else:
    print(":(")
import math


def solve():
    N = int(input())
    if math.floor(math.ceil(N / 1.08) * 1.08) == N:
        print(math.ceil(N / 1.08))
    else:
        print(':(')


if __name__ == "__main__":
    solve()
import math
n = int(input())
counter = False
for i in range(1, n + 1):
    if i + math.floor(i * 0.08) == n:
        print(i)
        break
else:
    print(':(')
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(ok=n, ng=0, solve=(lambda x: x * 1.08 >= n))
if int(ans * 1.08) == n:
    print(ans)
else:
    print(':(')
N = int(input())

for i in range(1, N + 1):
  if int(1.08 * i) == N:
    print(i)
    break
else:
  print(":(")
#!/usr/bin/env python3
#%% for atcoder uniittest use
import sys
input= lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(10**9)
def pin(type=int):return map(type,input().split())
def tupin(t=int):return tuple(pin(t))
def lispin(t=int):return list(pin(t))
#%%code
from fractions import gcd
def resolve():
    N=int(input())
    for i in range(N+100):
        if int(i*1.08)==N:
            print(i)
            return

    print(":(")
#%%submit!
resolve()
import math

n = int(input())
for i in range(n+1):
    if math.floor(i * 1.08) == n:
        print(i)
        exit(0)
print(":(")
n=int(input())
m=int(n/1.08)
for x in [0,1]:
    if n==int((m+x)*1.08):
        print(m+x)
        break
else:print(":(")
import math
N = int(input())

if math.floor(math.ceil(N / 1.08) * 1.08) == N:
  print(math.ceil(N / 1.08))
else:
  print(':(')
import math

n = int(input())

without_tax = float(n/1.08)
without_tax_floor = math.floor(without_tax)
without_tax_ceil = math.ceil(without_tax)

if math.floor(without_tax_floor * 1.08) == n:
    print(without_tax_floor)
elif math.floor(without_tax_ceil * 1.08) == n:
    print(without_tax_ceil)
else:
    print(':(')
N = int(input())

a = N / 1.08
b = (N + 1) / 1.08 - 0.1 ** 5

if a % 1 == 0 or int(b) - int(a) >= 1:
    print(int(b))
else:
    print(':(')
n=int(input())
for i in range(n+1):
    if int(i*1.08)==n:
        print(i)
        exit()
print(':(')
import math

N = int(input())

X = N/1.08

if (X % 1 == 0):
  print(int(X))
elif (math.floor(math.ceil(X) * 1.08) == N):
  print(math.ceil(X))
else:
  print(":(")
#!/usr/bin/env python3

import math

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

    div = n/1.08
    fl = math.floor(div)
    if math.floor(fl*1.08) == n:
        print(fl)
    elif math.floor((fl+1)*1.08) == n:
        print(fl+1)
    else:
        print(":(")


if __name__ == '__main__':
    main()
n =int(input())
min = n//1.08
max = n//1.08+1
ans = 0
if int(min*1.08) == n:
    ans = min
if int(max*1.08) == n:
    ans = max
if ans != 0:
    print(int(ans))
else:
    print(":(")
import math
n=int(input())
for i in range(1,n+1):
  if math.floor(i*1.08)==n:
    print(i)
    break
  else:
    continue
else:
  print(":(")
# https://atcoder.jp/contests/sumitrust2019/tasks/sumitb2019_b

def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))

N = INT()

x = 0
while True:
    ans = int(x * 1.08)
    if ans == N:
        print(x)
        break
    elif ans > N:
        print(":(")
        break
    x += 1
#!/usr/bin/env python
# coding: utf-8

# In[39]:


N = int(input())


# In[40]:


for x in range(int(N * 10/11), N+1):
    if (x*1.08)//1 == N:
        print(x)
        break
else:
    print(":(")


# In[ ]:
import sys
n = int(input())
for i in range(1, 46300):
    if n*25/27 <= i < (n+1)*25/27:
        print(i)
        sys.exit()
print(":(")
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

n = int(input())

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

ans = bin_search(n, 0, lambda x: (x * 1.08) >= n)
if int(ans * 1.08) == n:
    print(ans)
else:
    print(':(')
import math
s=int(input())
n = math.ceil(s/1.08)


if math.floor(n*1.08)==s:
    print(n)
else:
    print(":(")
import math
N = int(input())
for i in range(1,50001):
  if math.floor(i * 1.08) == N:
    print(i)
    exit(0)
print(':(')
N = int(input())
for x in range(1,N+1):
    if int(x*1.08) == N:
        print(x)
        exit()
print(":(")
import math
N = int(input())
for i in range(N,0,-1):
    if math.floor(i*1.08) == N:
        print(i)
        exit()
print(':(')
import math
n = int(input())

ans_bool = False
ans_num = 0

for i in range(1, n+1):
    if math.floor(i * 1.08) == n:
        ans_bool = True
        ans_num = i
    else:
        pass
if ans_bool:
    print(ans_num)
else:
    print(":(")
import math

n = int(input())
ntax = math.ceil(n/1.08)
if int(ntax * 1.08) != n:
	print(':(')
else:
	print(ntax)
import math

n = int(input())

x = n/1.08
t1 = math.ceil(x)
t2 = math.floor(x)

if math.floor(t1 * 1.08) == n:
    print(t1)
elif math.floor(t2*1.08) == n:
    print(t2)
else:
    print(':(')
N = int(input()) * 100
m = N // 108
if int(m * 1.08) == N//100:
    print(m)
elif int((m+1) * 1.08) == N//100:
    print(m+1)
else:
    print(":(")
import math
n = float(input())
m = n / 1.08
if math.floor(math.floor(m) * 1.08) == n:
    print(math.floor(m))
elif math.floor(math.ceil(m) * 1.08) == n:
    print(math.ceil(m))
else:
    print(':(')
import math

n = int(input())
div_num = round(n/1.08)

for i in range(n+1):
    if math.floor(i * 1.08) == n:
        print(i)
        exit()
print(':(')
N = int(input())

temp = int(N // 1.08)
if int(temp * 1.08) == N:
    print(temp)
elif int((temp + 1) * 1.08) == N:
    print(temp + 1)
else:
    print(':(')
N = int(input())

senter = N // 1.08

for i in range(1000):
    if int((senter-100+i) * 1.08) == N:
        print(int(senter-100+i))
        break
else:
    print(":(")
n = int(input())
for x in range(1, 50005):
    if x * 108//100 == n:
        print(x)
        exit()
else:
    print(':(')
#!/usr/bin/env python3
import math

N = int(input().split()[0])
X = N / 1.08

# if math.floor(math.ceil(X) * 1.08) == N:
#     ans = math.ceil(X)
# elif math.floor(math.floor(X) * 1.08) == N:
#     ans = math.floor(X)
# else:
#     ans = ":("

if math.floor(math.ceil(X) * 1.08) == N:
    ans = math.ceil(X)
elif math.floor(math.floor(X) * 1.08) == N:
    ans = math.floor(X)
else:
    ans = ":("

print(ans)
# 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(':(')
import math

n = int(input())
f = math.floor(n / 1.08)
c = math.ceil(n / 1.08)
for i in [f, c]:
    if math.floor(i*1.08) == n:
        print(i)
        exit()
print(':(')
N=int(input())
X=int(N/1.08)
C=[X-1,X,X+1]
for c in C:
    d=int(c*1.08)
    if d==N:
        print(c)
        break
else:
    print(":(")
import math
 
# Input the amount of money Takahashi paid
N = int(input())
 
# Find nearest integer price more than or equal to X/1.08
X = math.ceil(N / 1.08)
 
# Check if the "taxed price" is equal to N yen
if math.floor(X * 1.08) == N:
	print(X)
else:
	print(":(")
import math
n = int(input())
lx = math.ceil(n/1.08)
rx = (n+1)/1.08
print(lx if lx<rx else ':(' )
# -*- coding:utf-8 -*-
import math

n = int(input())
ret_just = math.floor(n/1.08)
ret_minus1 = ret_just - 1
ret_plus1 = ret_just + 1

if math.floor(ret_just*1.08) == n:
    print(ret_just)
elif math.floor(ret_minus1*1.08) == n:
    print(ret_minus1)
elif math.floor(ret_plus1*1.08) == n:
    print(ret_plus1)
else:
    print(":(")
from decimal import Decimal
N = int(input())
M = int(N/Decimal(1.08)) + 1
if N == int(M*Decimal(1.08)) :
    print( int(M))
else :
    print(':(')
#インクルード
import math
#ロジック
N = int(input())
kirisage = math.floor(N / 1.08)
kiriage = math.ceil(N / 1.08)
if N == math.floor(kirisage * 1.08):
  print(kirisage)
elif N == math.floor(kiriage * 1.08):
  print(kiriage)
else:
  print(":(")
import math

def main():
    N = int(input())
    X = math.ceil(N / 1.08)
    if N == math.floor(X * 1.08):
        print(X)
    else:
        print(':(')
main()
x=int(input())
a=(x*100)//108
if (a*1.08)//1==x:
    print(a)
elif ((a+1)*1.08)//1==x:
    print(a+1)
else:
    print(":(")
import math
#入力
x = int(input())
x_upper = (x+1) / 1.08
x_lower = x / 1.08
x_candidate = math.ceil(x_lower)
if x_lower <= x_candidate < x_upper:
    print(x_candidate)
else:
    print(":(")
def resolve():
    import math
    N = int(input())
    for i in range(N+1):
        if math.floor(i*1.08) == N:
            print(i)
            exit()
    print(":(")
resolve()
n = int(input())
rate = 1.08
for i in range(1,n+1):
    val = int(i*rate)
    if val == n:
        print(i)
        exit()
print(":(")
# -*- coding: utf-8 -*-

import math

n = int(input())

tmp=0
if n%27==0:
    tmp=int(n*25/27)
elif (n+1)%27==0:
    tmp=int((n+1)*25/27)-1
else:
    tmp=math.ceil(n*25/27)

if math.floor(tmp*1.08)==n:
    print(tmp)
else:
    print(":(")
n = int(input())
x = int((n+1)/1.08)

if int(x*1.08) == n:
    print(x)
else:
    print(':(')
n=int(input())
if (n+1)//1.08 != n//1.08:
  res = int((n+1.08)//1.08)
  print(res)
else:
  print(':(')
n = int(input())
for i in range(1,50000):
    if int(i*1.08) == n:
        print(i)
        exit()
print(":(")
n = int(input())

for x in range(n + 1):
    if int(x * 1.08) == n:
        print(x)
        break
else:
    print(':(')
import math
def taxminus(X):
    return X/1.08,(X+1)/1.08
N=int(input())
min,max=taxminus(N)
min=math.ceil(min)
if min>=max:
    print(":(")
else:
    print(min)
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(':(')
n=int(input())
for i in range(46298):
  if int(i*1.08)==n:
    print(i)
    break
else:
  print(":(")
#N,a,b = map(int,input().split())
N = int(input())

X=int(N/1.08)
if int(X*1.08) == N:
    print(X)

elif int((X+1)*1.08) == N:
    print(X+1)

else:
    print(':(')
import math

N = int(input())
ans = math.ceil(N / 1.08)
if math.floor(ans * 1.08) != N:
    print(":(")
    exit(0)
else:
    print(ans)
n = int(input())
for i in range(1, 50000):
  if i * 108 // 100 == n:
    print(i)
    exit()
print(':(')
import math

def resolve():
    N = int(input())
    if (N + 1) * 100 % 135 == 0 or (N + 0.5) * 100 % 135 == 0 :
        print(":(")
    else:
        print(math.ceil(N/1.08))
resolve()
import math
n=int(input())
ans=math.ceil(n/1.08)
if math.floor(ans*1.08)==n:
    print(ans)
else:
    print(':(')
n=int(input())
for x in range(n+1):
    if x*108//100==n:
        print(x)
        break
else:
    print(":(")
N = int(input())

import math
import sys

for i in range(1, 50000+1):
  if math.floor(i * 1.08) == N:
    print(i)
    sys.exit()
print(":(")
import math
A = [math.floor(i*1.08) for i in range(1, 50001)]
X = int(input())
flag = 0
for i in range(50000):
  if X == A[i]:
    print(i+1)
    flag = 1
    break
if flag == 0:
  print(":(")
import math
def resolve():
  found = False
  N = int(input())
  for x in range(int(N/1.08), int((N+1)/1.08+1)):
    if N == math.floor(x*1.08):
      print(x)
      found = True
      break
  
  if not found:
    print(":(")

resolve()
n =int(input())
b = False
for i in range(int(n//1.08-1), int(n//1.08+4),1):
    if n == int(i*1.08):
        b = True
        break

if b == True:
    print(i)
else:
    print(':(')
N = int(input())
ans = 0
for i in range(10**5):
    if N == int(i * 1.08):
        ans = i
        break

if ans:
    print(ans)
else:
    print(':(')
import math
N = int(input())
a = math.ceil(N / 1.08)
if math.floor(a * 1.08) == N:
    print(a)
else:
    print(':(')
# 初期入力　　２０２０－０７２７　21：50
import math
import sys
input = sys.stdin.readline  #文字列では使わない
N = int(input())
ans =":("
for i in range(1,50001):
    a =int( i *1.08 )
    if a==N:
        ans =i
        break
print(ans)
def resolve():
    import math
    n = int(input())
    for i in range(1, n+1):
        if math.floor(i * 1.08) == n:
            print(i)
            quit()
    print(":(")
resolve()
N = int(input())

X = N // 1.08

if int(X * 1.08) == N:
    print(int(X))
elif int((X + 1) * 1.08) == N:
    print(int(X + 1))
else:
    print(":(")
N = int(input())
min = N * 100/108
max = (N+1)*100/108
for i in range(50000):
    if min <= i and i < max:
        print(i)
        break
else:
    print(":(")
import math

n = int(input())
ans = int(n / 1.1)
while True:
  if math.floor(ans * 1.08) == n:
    break
  ans += 1
  
  if ans > n:
    break
if ans > n:
  print(':(')
else:
  print(ans)
N=int(input())

for i in range(50000):
    if int((i+1)*1.08) == N:
        print(i+1)
        break
    elif int((i+1)*1.08) > N:
        print(":(")
        break