Problem:
 Score: 200 points    Problem Statement  Takahashi bought a piece of apple pie at ABC Confiserie. According to his memory, he paid N yen (the currency of Japan) for it.  The consumption tax rate for foods in this shop is 8 percent. That is, to buy an apple pie priced at X yen before tax, you have to pay X \times 1.08 yen (rounded down to the nearest integer).  Takahashi forgot the price of his apple pie before tax, X , and wants to know it again. Write a program that takes N as input and finds X . We assume X is an integer.  If there are multiple possible values for X , find any one of them. Also, Takahashi's memory of N , the amount he paid, may be incorrect. If no value could be X , report that fact.      Constraints   1 \leq N \leq 50000  N is an integer.         Input  Input is given from Standard Input in the following format:  N       Output  If there are values that could be X , the price of the apple pie before tax, print any one of them. If there are multiple such values, printing any one of them will be accepted. If no value could be X , print :( .        Sample Input 1 432      Sample Output 1 400  If the apple pie is priced at 400 yen before tax, you have to pay 400 \times 1.08 = 432 yen to buy one. Otherwise, the amount you have to pay will not be 432 yen.       Sample Input 2 1079      Sample Output 2 :(  There is no possible price before tax for which you have to pay 1079 yen with tax.       Sample Input 3 1001      Sample Output 3 927  If the apple pie is priced 927 yen before tax, by rounding down 927 \times 1.08 = 1001.16 , you have to pay 1001 yen.

Solution (Python):
n=int(input())
ans=int(n/1.08)+1
if (ans*1.08)//1==n:
    print(ans)
elif n*100%108==0 and (ans-1)*1.08==n:
    print(ans-1)
else:
    print(':(')

Solution (Python):
N=int(input())
X=int(N//1.1)
ans=":("
for i in range(X, N+10):
  if int(i*1.08)==N:
    ans=i
    break
print(ans)

Solution (Python):
import math

n = int(input())

ans = round(n * 100 / 108)


if n == math.floor(ans * 1.08):
  print(ans)
elif n == math.floor((ans-1) * 1.08):
  print(ans-1)
elif n == math.floor((ans+1) * 1.08):
  print(ans+1)
else:
  print(':(')

Solution (Python):
price = int(input())

N =price//1.08
if (N)*1.08 >= price and (N)*1.08 < price+1:
  print(int(N))
elif (N+1)*1.08 >= price and (N+1)*1.08 < price+1:
  print(int(N+1))
else:
  print(":(")

Solution (Python):
N = int(input())
X = int(N//1.08)

if (X*1.08)//1 == N:
    print(X)
elif ((X+1)*1.08)//1 == N:
    print(X+1)
else:
    print(":(")

Solution (Python):
n = int(input())
a = 0

for i in range(46298) :
    num = int(i * 1.08)
    if num == n :
        a = 1
        print (i)
        break

if a == 0 :
    print (':(')

Solution (Python):
import math

N = int(input())

ans = int(N // 1.08)

if math.floor(ans * 1.08) == N:
  print(ans)
else:
  if math.floor((ans+1) * 1.08) == N:
    print(ans+1)
  else:
    print(":(")

Solution (Python):
import math
N = int(input())
tmp = math.ceil(N / 1.08)
o = math.floor(tmp * 1.08)
if o == N:
    print(tmp)
else:
    print(":(")

Solution (Python):
n = int(input())
d = int(n / 1.08)
if int(d * 1.08) == n:
    r = d
else:
    if int((d + 1) * 1.08) == n:
        r = d + 1
    else:
        r = ':('
print(r)

Solution (Python):
N = int(input())


for i in range(50001):
    if N == int(i * 1.08):
        print(i)
        exit(0)
print(':(')

Solution (Python):

nums = {}

for w_tax in range(1, 50000+1):
    nums[w_tax] = ":("

for wo_tax in range(1, 50000+1):
    w_tax = int(wo_tax * 1.08)
    nums[w_tax] = wo_tax





a = int(input()) 
out = nums[a]
print(out)

Solution (Python):
n = int(input())

a = n//1.08



if int(a*1.08//1) == n:
	print(int(a))
elif int((a+1)*1.08//1) == n:
	print(int(a+1))
else:
	print(":(")

Solution (Python):
import math
a=float(input())





if math.floor(math.floor(a/1.08)*1.08) ==a or math.floor(math.ceil(a/1.08)*1.08) ==a:
  print(math.ceil(a/1.08))
else:
  print(":(")

Solution (Python):
a = int(raw_input())
from math import floor
for i in range(1,50001):
  r = int(floor(i + i*0.08))
  if r > a:
    ans = ":("
    break
  if r == a:
    ans = i
    break
  else:
    continue
print(ans)

Solution (Python):
import math
n = int(input())
x = math.ceil(n /1.08)

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

Solution (Python):
n = int(input())
x_1 = int(n/1.08)
x_2 = int(n/1.08)+1
if int(x_1*1.08) == n:
  print(x_1)
elif int(x_2*1.08) == n:
  print(x_2)
else:
  
  print(":(")

Solution (Python):
n = int(input())
x = -(-n // 1.08)
if int(x * 1.08) == n:
    print(int(x))
else:
    print(':(')

Solution (Python):
import math
N = int(input())

n1 = N / 1.08

if math.floor(math.floor(n1)*1.08) == N:
    print(math.floor(n1))
elif math.floor(math.floor(n1 + 1)*1.08) == N:
    print(math.floor(n1 + 1))
else:
    print(":(")

Solution (Python):
import math

n = int(input())

a = int(math.floor(n / 1.08))

aa = int(math.floor(a * 1.08))
if n == aa:
  print(a)
  exit()
else:
  aa = (a+1) * 1.08
  aa = int(math.floor(aa))
  if n == aa:
    print(a+1)
  else:
    print(':(')

Solution (Python):
import math
import decimal

def main():
    n = int(input())
    x = n / 108 * 100

    x_int_list = [math.ceil(x), math.floor(x)]
    for temp_x in x_int_list:
        temp_n1 = temp_x * 1.08
        temp_n2 = int(temp_n1)
        
        if temp_n2 == n:
            print(temp_x)
            return
    print(':(')


if __name__ == '__main__':
    main()

Solution (Python):
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(":(")

Solution (Python):
from math import ceil

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

Solution (Python):
import math
n=int(input())
x=math.floor((n*25)/27)
x=int(x)
for i in range(x,n+1):
    if math.floor(i*1.08)==n:
        print(i)
        break
    elif math.floor(i*1.08)>n:
        print(":(")
        break

Solution (Python):
N = int(input())


def ans(N):
    for X in range(1, N+1):
        if int(X * 1.08) == N:
            return X
    return ":("


print(ans(N))

Solution (Python):
N=int(input())

X1=int(N/1.08)

while X1 * 1.08 < N + 1:
    if (int(X1 * 1.08) == N):
        print(X1)
        exit( )
    X1 += 1
print(":(")

Solution (Python):
n = int(input())

for i in range(1, 50001):
    if int(i * 1.08) == n:
        print(i)
        break
else:
    print(':(')

Solution (Python):


import sys
import math

debug = False

def log(text):
    if debug:
        print(text)

def parse_input(lines_as_string = None):

    global debug
    lines = []
    if lines_as_string is None:
        debug = False
        
        
        lines.append(input())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]

    n = int(lines[0])

    return (n, )


def solve(n):


    x = n / 1.08

    a = int(math.floor(math.floor(x) * 1.08))
    b = int(math.floor(math.ceil(x) * 1.08))

    result = ':('
    if a == n:
        result = str(int(math.floor(x)))

    if b == n:
        result = str(int(math.ceil(x)))


    return result 


def main():
    
    result = solve(*parse_input())
    if isinstance(result, list):
        for r in result:
            print("%s" % r, sep='')
    else:
        print("%s" % result, sep='')

if __name__ == '__main__':

    main()

Solution (Python):
import numpy as np

n = int(input())

a = np.arange(50000)
a_t = (a * 1.08).astype(np.int32)

if n in a_t:
    print(*a[np.where(a_t == n)])
else:
    print(":(")

Solution (Python):
import sys
input = sys.stdin.readline
n = int(input())
nt = int(n * (100/108))
tt = 108/100
ntt = int(nt * tt)
if n == ntt:
    print(nt)
    exit()
ntt = int((nt + 1) * tt)
if n == ntt:
    print(nt + 1)
else:
    print(':(')

Solution (Python):
N = int(input())
n = int(N/1.08)
while(True):
    apple = int(n*1.08)
    if apple<N:
        n+=1
    elif apple==N:
        print(n)
        break
    elif apple>N:
        print(':(')
        break

Solution (Python):
import sys
input = sys.stdin.readline
n = int(input())
for i in range(n + 1):
    if int(i * 1.08) == n:
        print(i)
        exit()
else:   
    print(':(')

Solution (Python):
n=int(input())
flag=1
a=0
for i in range(n+1):
  if int(i*1.08)==n:
    flag*=0
    a=i
if flag==1:
  print(':(')
else:
  print(a)

Solution (Python):
import math

N = int(input())

for x in range(N + 1):
    if math.floor(x * 1.08) == N:
        print(x)
        exit()
print(':(')

Solution (Python):
import math


N = int(input())

ans = 0
flag = False
for X in range(N+1):
    if math.floor(X * 1.08) == N:
        ans = X
        flag = True
        break
if flag:
    print(ans)
else:
    print(':(')

Solution (Python):
import math

n = int(input())

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

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

Solution (Python):
import math
N = int(input())

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

Solution (Python):
from decimal import *
N=Decimal(input())
X=Decimal(N/Decimal("1.08"))
X=int(X)
if int(X*Decimal("1.08"))==int(N):
    print( '{:.10g}'.format(int(X)))
elif int((X+1)*Decimal("1.08"))==int(N):
    print( '{:.10g}'.format(int(X+1)))
else:
    print(str(':('))

Solution (Python):
import math
N=int(input())
ans=0
for i in range(N+1):
  tmp=math.floor(i*1.08)
  if (tmp==N) :
    ans=i
    break

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

Solution (Python):
N=int(input())

if int(int(N/1.08)*1.08)==N:
    print(int(N/1.08))
elif int((int(N/1.08)+1)*1.08)==N:
    print(int(N/1.08)+1)
else:
    print(":(")

Solution (Python):
n = int(input())
x = 100/108*n
x1 = int(x//1)
x2 = int(x1*1.08//1)
if x2 == n:
  print(x1)
elif int((x1+1)*1.08//1) == n:
  print(x1+1)
elif int((x1-1)*1.08//1) == n:
  print(x1-1)
else:
  print(":(")

Solution (Python):
from math import floor
n = int(input())
price =	int(n/1.08)
if floor(price*1.08)==n:
	print(price)
elif floor((price+1)*1.08)==n:
	print(price+1)
else:
	print(":(")

Solution (Python):
from collections import deque,defaultdict,Counter
from itertools import accumulate
import bisect
from heapq import heappop,heappush
from fractions import gcd
from copy import deepcopy
import math
import queue


Mod = 1000000007
import sys

sys.setrecursionlimit(100000) 
  
def sieve_of_eratosthenes(n):
    if not isinstance(n,int):
        raise TypeError("n is not int")
    if n<2:
        raise ValueError("n is not effective")
    prime = [1]*(n+1)
    for i in range(2,int(math.sqrt(n))+1):
        if prime[i] == 1:
            for j in range(2*i,n+1):
                if j%i == 0:
                    prime[j] = 0
    res = []
    for i in range(2,n+1):
        if prime[i] == 1:
            res.append(i)
    return res

def factorial(i):
    if i == 1:
        return 1
    else:
        return i*factorial(i-1)
 
class UnionFind:
    def __init__(self,n):
        self.parent = [i for i in range(n+1)]
        self.rank = [0 for i in range(n+1)]
    
    def findroot(self,x):
        if x == self.parent[x]:
            return x
        else:
            y = self.parent[x]
            y = self.findroot(self.parent[x])
            return y
    
    def union(self,x,y):
        px = self.findroot(x)
        py = self.findroot(y)
        if px < py:
            self.parent[py] = px
        else:
            self.parent[px] = py
 
    def same_group_or_no(self,x,y):
        return self.findroot(x) == self.findroot(y)




def main(): 
    N = int(input())
    X1 = math.floor(N/1.08)
    X2 = math.ceil(N/1.08)
    if math.floor(X1*1.08) == N:
        print(X1)
    elif math.floor(X2*1.08) == N:
        print(X2)
    else:
        print(":(")
if __name__ == "__main__":
    main()

Solution (Python):
import math
n = int(input())

tax = 1.08
tmp = n / tax
if tmp.is_integer():
    print(int(tmp))

else:
    tmp = math.floor(tmp)
    if int(math.floor((tmp - 1) * tax)) == n:
        print(int(math.floor(tmp - 1)))
    elif int(math.floor((tmp) * tax)) == n:
        print(int(math.floor((tmp))))
    elif int(math.floor((tmp + 1) * tax)) == n:
        print(int(math.floor((tmp + 1))))
    else:
        print(':(')

Solution (Python):
import math

n = int(input())

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

Solution (Python):
import math
n = int(input())
x = n/1.08
y = math.ceil(x)
if math.floor(y*1.08) == n:
  print(y)
else:
  print(":(")

Solution (Python):
import math
N = int(input())
X = N/1.08
if(math.floor(math.floor(X)*1.08)==N):
    print(math.floor(X))
elif(math.floor((math.floor(X)+1)*1.08)==N):
    print(math.floor(X)+1)
else:
    print(':(')

Solution (Python):
N=int(input())
a=int(N/1.08)
if N+1>a*1.08>=N:
  print(a)
else:
  if N+1>(a+1)*1.08>=N:
    print(a+1)
  else:
    print(":(")

Solution (Python):


n = int(input())
x = 100 * n // 108
y1 = int(x * 1.08)
y2 = int((x + 1) * 1.08)
if n == y1:
    print(x)
elif n == y2:
    print(x + 1)
else:
    print(":(")

Solution (Python):
N=int(input())
import sys
for i in range(1,50001):
    if int(i*1.08)==N:
        print(i)
        sys.exit()
print(':(')

Solution (Python):
import math

N = int(input())

x_min = math.floor(N / 1.08)
x_max = (N + 1) / 1.08

x_list = [x_min, x_min + 1]
for x in x_list:
    if math.floor(x * 1.08) == N:
        print(x)
        exit()
print(':(')

Solution (Python):
import math
N= int(input())

a = N/1.08
b = (N+1)/1.08

lst = list(range(math.ceil(a), math.ceil(b)))
if lst:print(lst[0])
else:print(':(')

Solution (Python):
n=int(input())
for x in range(1,50001):
    if int(x*1.08)==n:
        print(x)
        exit()
else:
    print(':(')

Solution (Python):
import math
N = int(input())
l = N/1.08
r = (N+1)/1.08
if math.ceil(l)<r:
    print(math.ceil(l))
else:
    print(':(')

Solution (Python):
import math
N = int(input())
val = N / 1.08
val_min = math.floor(val)
val_max = val_min + 1
price_min = math.floor(val_min * 1.08)
price_max = math.floor(val_max * 1.08)
if price_min == N:
    print(val_min)
elif price_max == N:
    print(val_max)
else:
    print(":(")

Solution (Python):
n=float(input())
import math

if math.modf(n / 1.08)[0] == 0:
    ans = math.floor(n / 1.08)
else:
    ans = math.floor(n / 1.08) + 1

if math.floor(ans * 1.08) == n:
    print(ans)
else:
    print(':(')

Solution (Python):
N = int(input())

origin_start = N//1.08

origins = [origin_start + i for i in range(5)]

result = ":("
for origin in origins:
  if int(origin * 1.08) == N:
    result = int(origin)
print(result)

Solution (Python):
n = int(input())

tmp = int(n*100/108)
a = int(tmp*108/100)
b = int((tmp+1)*108/100)

if a != n and b!= n:
	print(':(')
elif a == n:
 	print(tmp)
else:
 	print(tmp+1)

Solution (Python):
x=int(input())
if(-((-x)//1.08)<(x+1)/1.08):
    print(int(-((-x)//1.08)))
else:
    print(":(")

Solution (Python):
from decimal import *
N=int(input())
a=int(N/1.08)
flg=False
ans=0
for i in range(a-1,a+2):
    if int(i*1.08)==N:
        flg=True
        ans=i
print(ans if flg else ":(")

Solution (Python):
import sys
input = sys.stdin.readline

N = int(input())

for n in range(N):
    if int((n+1) * 1.08) == N:
        print((n+1))
        exit()
    elif int((n+1) * 1.08) > N:
        print(":(")
        exit()

Solution (Python):
import math
n=int(input())
s=n/1.08
d=math.ceil(s)
if math.floor(d*1.08)==n:
  print(d)
else:
  print(":(")

Solution (Python):
N = int(input())

X = int(N/1.08)
i = 0
while True:
  if int((X+i)*1.08) == N:
    print(int(X+i))
    break
  elif int((X + i)* 1.08) > N:
    print(":(")
    break
  else:
    i += 1

Solution (Python):
N=int(input())

P=N//1.08
A=(P*1.08)//1
B=((P+1)*1.08)//1

if A!=N and B!=N:
	print(":(")
elif A==N:
	print(int(P))
else:
	print(int(P+1))

Solution (Python):
import math

N = int(input())

a = int(round(N / 1.08))
b = a + 1


A = int(math.floor(a*1.08))
B = int(math.floor(b*1.08))


if A == N:
    print(a)
elif B == N:
    print(b)
else:
    print(":(")

Solution (Python):

import math
n = int(input())
genka_min = n * 100 / 108
genka_max = (n+1) * 100 / 108
ok = 0
ans = 0

for i in range(math.floor(genka_min),math.ceil(genka_max)+1):
    if  math.floor(i*1.08) == n:
        ok = 1
        ans = i
if ok:
    print(ans)
else:
    print(":(")

Solution (Python):
import math

n = int(input())
x = math.ceil(n / 108 * 100)

if math.floor(x * 108 / 100) == n:
    print(x)
else:
    print(':(')

Solution (Python):
import math

N = int(input())
n = math.floor(N / 1.08)
ans = ':('

if (int(n*1.08) == N):
  ans = n
  
if (int((n+1)*1.08) == N):
  ans = n+1

print(ans)

Solution (Python):
def main():
    n = int(input())
    for i in range(1, n+1):
        if int(i * 1.08) == n:
            print(i)
            break
    else:
        print(':(')


if __name__ == '__main__':
    main()

Solution (Python):
n=int(input())
if n%27==13 or n%27==26:
  print(":(")
else:
  print(int(float(n+1)//1.08))

Solution (Python):

from math import floor, ceil
N = int(input())
tmp = floor(N / 1.08)
tmp2 = ceil(N / 1.08)
flag = False
if floor(tmp * 1.08) == N:
    print(tmp)
elif floor(tmp2 * 1.08) == N:
    print(tmp2)
else:
    print(":(")

Solution (Python):
import numpy as np

N = int(input())

x = np.arange(1, 50001)
y = (x * 1.08).astype(np.int)
v = np.argwhere(y == N)

if len(v) == 0:
    print(':(')
else:
    
    print(x[v[0]][0])

Solution (Python):
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(":(")

Solution (Python):
import math

N = int(input())
x1 = int(math.ceil(N/1.08))
x2 = int(math.floor(N/1.08))

price1 = int(x1*1.08)
price2 = int(x2*1.08)

if price1 == N:
    print(x1)
elif price2 == N:
    print(x2)
else:
    print(':(')

Solution (Python):
n = int(input())

for i in range(1,50001):
    if int(i*1.08) == n:
        print(i)
        exit()

print(':( ' )

Solution (Python):
N = int(input())
X = int(N/1.08)
X2 = X+1

if int(X*1.08)==N:
  print(X)
elif int(X2*1.08)==N:
  print(X2)
else:
  print(':(')

Solution (Python):
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(":(")

Solution (Python):
import math

N = int(input())
if math.ceil(N/1.08)*1.08>=N and math.ceil(N/1.08)*1.08<N+1:
    print(math.ceil(N/1.08))
else:
    print(':(')

Solution (Python):
a = int(input())
b  = int(a//1.08)
c  = b + 1
b2 = int(b*1.08)
c2 = int(c*1.08)

if a == b2:
    print(b)
elif a == c2:
    print(c)
else:
    print(":(")

Solution (Python):
import math
N = int(input())
tmp = math.ceil(N / 1.08)

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

Solution (Python):
import math

n = int(input())
ans = math.ceil(n / 1.08)
m = math.floor(ans * 1.08)

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

Solution (Python):
n=int(input())
x=n/1.08
if n==int(x)*1.08:
  print(int(x))
elif n==int((int(x)+1)*1.08):
  print(int(x)+1)
else:
  print(":(")

Solution (Python):
N = int(input())

n = round(N/1.08)


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

Solution (Python):
import sys

def getN():
    return int(input())
def getNM():
    return map(int, input().split())
def getlist():
    return list(map(int, input().split()))
import heapq
import bisect
import copy

def warshall_floyd(d, N):
    for k in range(N):
        for i in range(N):
            for j in range(N):
                d[i * N +j] = min(d[i * N +j], d[i * N + k] + d[k * N + j])
    return d

MOD = 10**9 + 7

def main():
    n = getN()
    for i in range(50001):
        if (i * 1.08) // 1 == n:
            print(i)
            return

    print(":(")

if __name__ == '__main__':
    main()

Solution (Python):
import math

N = int(input())

for A in range(1, 50001):
    if N == math.floor(A * 1.08):
        print(A)
        exit()

print(":(")

Solution (Python):
def main():
    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(':(')
    
if __name__ == "__main__":
    main()

Solution (Python):
n = int(input()) 
x=-(- n // 1.08)
if x-n/1.08 < 1/1.08:
  print(int(x))
else:
  print(":(")

Solution (Python):
import math

n = int(input())

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

Solution (Python):
N = int(input())
 


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

Solution (Python):
import math
N = int(input())
a = int(N//1.08)
if N == math.floor(a*1.08):
    print(a)
elif N == math.floor((a+1)*1.08):
    print(a+1)
else:
    print(":(")

Solution (Python):
a = int(input())
import math
u = a/1.08

ax = math.ceil(u)
z = math.floor(u)

if math.floor(ax * 1.08) != a and math.floor(z * 1.08) != a:
    print(':(')
else:
    if math.floor(ax*1.08) == a:
        print(ax)
    else:
        print(z)

Solution (Python):
N = int(input())
X = int(N/1.08)
A = int(X*1.08)

if A == N:
  print(X)
else:
  X = X+1
  A = int(X*1.08)
    
  if A == N:
    print(X)
  else:
    print(":(")

Solution (Python):


from sys import exit


ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))



def main():
    n = ii()
    if n<13:
        print(n)
        exit()


    for i in range(1,50000):
        if (i*108)//100 == n:
            print(i)
            exit()
    print(":(")


        


main()

Solution (Python):
n = int(input())
for i in range(1, 50000):
    if n == int(i * 1.08):
        print(i)
        exit()
print(":(")

Solution (Python):
from math import floor

N=int(input())
OKflag=False


for n in range(1,N+1):
    if floor(n*1.08)==N: 
        print(n)
        OKflag=True 
        break

if OKflag==False: 
    print(":(")

Solution (Python):
n = int(input())

ans = n * 100 // 108

n1 = ans * 108 // 100
n2 = (ans + 1) * 108 // 100

if n == n1:
  print(ans)
elif n == n2:
  print(ans + 1)
else:
  print(":(")

Solution (Python):
n = int(input())

tmp = int(n/1.08)
if(int(tmp*1.08) == n):
    print(tmp)
    exit()
elif(int((tmp+1)*1.08) == n):
    print(tmp+1)
    exit()
print(":(")

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

Solution (Python):
n = int(input())
x = int((n+1)/1.08)
n2 = int(x*1.08)

if n != n2:
    print(':(')
else:
    print(x)

Solution (Python):
m = int(input())
x = m // 1.08
x = int(x)
N = int(x * 1.08)
if N == m:
    print(x)
elif N > m:
    if int((x - 1) * 1.08) == m:
        print(x-1)
    else:
        print(":(")
elif N < m:
    if int((x + 1) * 1.08) == m:
        print(x+1)
    else:
        print(":(")
else:
    print(":(")

Solution (Python):
N = int(input())
for i in range(50001):
    if N == int(i * 1.08):
        print(i)
        exit()
print(':(')

Solution (Python):
N = int(input())
x = int(N / 1.08)
for y in range(x, x + 3):
    p = int(1.08 * y)
    if p == N:
        print(y)
        exit(0)
print(':(')

Solution (Python):
import math
N = int(input())


tmp = math.ceil(N/1.08)


if int(tmp * 1.08) == N:
    print(tmp)
else:
    print(":(")

Solution (Python):
N=int(input())
X1=int(N/1.08)
if int(X1*1.08)==N:
    print(X1)
elif int((X1+1)*1.08)==N:
    print(X1+1)
else:
    print(":(")

Solution (Python):
import math

n = int(input())

for i in range(n, 0, -1):
    if math.floor(i * 1.08) == n:
        print(i)
        quit()
print(":(")

Solution (Python):
import math
n=int(input())
t=0
for i in range(100000):
  t=math.floor(i*1.08)
  if(t==n):
    print(i)
    break
  if(i>n):
    print(":(")
    break

Solution (Python):
N=int(input())
ans=int(N/1.08)
check=int(ans*1.08)
ans2=ans+1
check2=int(ans2*1.08)
if check==N:
    print(int(N/1.08))
elif check2==N:
    print(ans2)
else:
    print(":(")

Solution (Python):
import math
n = int(input())
k = math.ceil(n/1.08)
if math.floor(k*1.08)==n:
  print(k)
else:
  print(":(")

Solution (Python):
N = int(input())

for i in range(N):
    now = N - i
    if now * 1.08 // 1 == N:
        print(now)
        exit()

print(':(')

Solution (Python):
from decimal import Decimal, ROUND_HALF_UP
N = int(input())

X = 100*N // 108

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

else:
    if ((X+1)*1.08) // 1 == N:
        print(X+1)
    else:
        print(":(")

Solution (Python):
import math
N = int(input())

for i in range(50001):
    if N == math.floor(i * 1.08):
        print(i)
        break
else:
    print(":(")

Solution (Python):
import math

N = int(input())

tax = int(N - N / 1.08)
moto = N - tax

if math.floor(moto * 1.08) == N:
    print(moto)
else:
    print(":(")

Solution (Python):
import sys
N = int(input())

for x in range(1, 50001):
    temp = x * 1.08

    if N <= temp < (N + 1):
        print(x)
        sys.exit()

print(":(")

Solution (Python):
x=[]
for i in range(1,50001):
    x.append(int(i*1.08))

n=int(input())
for i in range(50000):
    if n==x[i]:
        print(i+1)
        break
else:
    print(":(")

Solution (Python):
n=int(input())
x=int(n/1.08)
y=int((n+1)/1.08)
if int(x*1.08)==n:
  print(x)
elif int(y*1.08)==n:
  print(y)
else:
  print(':(')

Solution (Python):

import math

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

if math.floor(x*1.08) == n:
    print(x)
elif math.floor((x+1)*1.08) == n:
    print(x+1)
else:
    print(':(')

Solution (Python):
N = int(input())
w = round(N / 1.08)
ans = int(w * 1.08)
if ans == N:
    print(w)
elif int((w + 1) * 1.08) == N:
    print(w + 1)
elif int((w - 1) * 1.08) == N:
    print(w - 1)
else:
    print(":(")

Solution (Python):
N = int(input())
import math

for x in range(900000 + 1):
    if math.floor(x * 1.08) == N:
        print(x)
        break
else:
    print(':(')

Solution (Python):
import math
N = int(input())

Answer1 = N//1.08
Answer2 = Answer1 + 1

if math.floor(Answer1 * 1.08) == N:
  print(int(Answer1))
elif math.floor(Answer2 * 1.08) == N:
  print(int(Answer2))
else:
  print(":(")

Solution (Python):
n = int(input())
no_tax=n//1.08





if int(no_tax*1.08)==n:
  print(int(no_tax))
elif int((no_tax+1)*1.08)==n:
  print(int(no_tax+1))
else:
  print(":(")

Solution (Python):
import math
N=int(input())
A=math.floor(N/1.08)
B=math.floor(A*1.08)
if B==N:
  print(A)
else:
  B=math.floor((A+1)*1.08)
  if B==N:
    print(A+1)
  else:
    print(":(")

Solution (Python):
import math
n=int(input())
a=n/1.08
if math.floor(math.floor(a)*1.08)==n:
    print(math.floor(a))
elif math.floor(math.ceil(a)*1.08)==n:
    print(math.ceil(a))
else:
    print(':(')

Solution (Python):
import math
n=int(input())
a=1
for i in range(50000):
  if math.floor(i*1.08)==n:
    print(i)
    a=0
if a==1:
  print(":(")

Solution (Python):

import sys
f = sys.stdin
n = int(f.readline())

result = ':('
x2 = int(n / 1.08)
if int(x2 * 1.08) == n:
    result = x2
x1 = x2 - 1
if int(x1 * 1.08) == n:
    result = x1
x3 = x2 + 1
if int(x3 * 1.08) == n:
    result = x3

print(result)

Solution (Python):
import math

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

if int(X * 1.08) == N:
    print(X)
else:
    print(":(")

Solution (Python):
import math

n = int(input())

a = math.floor(n/1.08)

if math.floor(a*1.08) == n:
  print(a)
elif math.floor((a+1)*1.08) == n:
  print(a+1)
else:
  print(':(')

Solution (Python):
n=int(input())
f=False
for i in range(1,5*10**4+1):
  if n==i*1.08//1:
    f=True
    break
if f:
  print(i)
else:
  print(":(")

Solution (Python):

def main():
    N = int(input())
    left = N / 1.08
    right = (N+1) / 1.08
    for i in range(int(left - 1), int(right + 1) + 1):
        if left <= i < right:
            print(i)
            return
    print(":(")
main()

Solution (Python):
n = int(input())

taxoff = n/1.08
ans = int(taxoff)
if n == int(ans*1.08):
    print(int(n/1.08))
elif n == int((ans+1)*1.08):
    print(ans+1)
elif n == int((ans-1)*1.08):
    print(ans-1)
else:
    print(":(")

Solution (Python):

import math
si = lambda: input()
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))
n = ni()
ans = 0

ans = (n*100)/108

ans = math.ceil(ans)


if n==math.floor(ans*1.08):
    print(ans)
else:
    print(':(')

Solution (Python):
n = int(input())

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

Solution (Python):
import math
N = int(input())

X = math.floor(N/1.08)
X2 = math.floor(X*1.08)


while(N>X2):
  X=X+1
  X2 = math.floor(X*1.08)


if N==X2:
  print(X)
  
else:
  print(":(")

Solution (Python):
from sys import stdin
a = int(stdin.readline().rstrip())
b = 0
for i in range(a+1):
    if int(i * 1.08) == a:
        m = i
        b = 1
if b == 0:
    m = (':(')

print(m)

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

Solution (Python):
n = int(input())
a = int(n/1.08)
b = a+1
if (int(a*1.08)==n):
    print(a)
elif (int(b*1.08)==n):
    print(b)
else:
    print(':(')

Solution (Python):
N = int(input())


ans = ":("
for i in range(50000):
    if i * 1.08 // 1 == N:
        ans = i
        break

print(ans)

Solution (Python):
import math

m = int(input())
tmp = False
for i in range(1, 51000):
    if int(math.floor(i * 1.08)) == m:
        tmp = True
        count = i
        break
if tmp:
    print(i)
else:
    print(":(")

Solution (Python):
n = int(input())

flag = False
for v in range(int(n/1.08)-3, int(n/1.08)+3):
    if int(v*1.08) == n: 
        flag = True
        break

if flag:
    print(v)
else:
    print(':(')

Solution (Python):
from collections import defaultdict
import sys
import math
from datetime import datetime
import re
import math
import math
def sol(n):
    A = math.floor(math.ceil(n/1.08) * 1.08) == n
    if A:
        return math.ceil(n/1.08)
    B = math.floor(math.floor(n/1.08) * 1.08) == n
    if B:
        return math.floor(n/1.08)
    return ":("



do_submit = True


def input_parse(input_str):
    lines = [x.strip() for x in input_str.split("\n") if x.strip()]
    parsed_lines = [list(map(str, line.split())) for line in lines]
    print(parsed_lines)
    n = int(parsed_lines[0][0])
    
    
    return n


if not do_submit:
    S = input_parse("""
    432
    """)
    print(sol(S))

    S = input_parse("""
    1079
    """)
    print(sol(S))

    S = input_parse("""
    1001
    """)
    print(sol(S))



else:
    
    S = int(input())
    print(sol(S))

Solution (Python):
import math
n = int(input())
if n != 1 and (n%27 == 13 or n%27 == 26):
  print(":(")
else:
  print(math.ceil(n/1.08))

Solution (Python):
import math
N = int(input())

x1 = N/1.08
z1 = int(math.floor(x1))
if z1 == x1:
    print(z1)
elif math.floor((z1+1)*1.08)==N:
    print(z1+1)
else:
    print(':(')

Solution (Python):
import math

N = int(input())

result = math.ceil(N / 1.08)

if math.floor(result*1.08) == N:
   print(math.ceil(result) )
else:
   print(":(")

Solution (Python):
n = int(input())

a = int(n / 1.09)
b = int(n / 1.07)

flag = 0
for i in range(a, b+2):
    if int(1.08 * i) == n:
        print(i)
        flag = 1
        break

if flag == 0:
    print(':(')