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):
import math
N = int(input())

X = N / 1.08

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

Solution (Python):
import math
from math import gcd,pi,sqrt
INF = float("inf")
MOD = 10**9 + 7

import sys
sys.setrecursionlimit(10**6)
import itertools
import bisect
from collections import Counter,deque
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]


def main():
    N = i_input()

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

    print(":(")
  
 
  
if __name__=="__main__":
    main()

Solution (Python):
N = int(input())
for n in range(100000):
    x = int(n*1.08)
    if N==x:
        print(n)
        exit()
    if x > N:
        break
print(':(')

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

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

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

Solution (Python):
from math import floor
N = int(input())
Flag = False
for X in range(1,46300):
    if floor(X*1.08)==N:
        Flag = True
        break
print([':(',X][Flag])

Solution (Python):
from sys import stdin, stdout

def print(x):
    stdout.write(str(x))

def solve():
    n = int(stdin.readline())
    x = n * 100 // 108
    if x * 108 // 100 == n: 
        print(x)
    elif (x+1) * 108 // 100 == n:
        print(x + 1)
    else:
        print(":(")

def main():
    solve()


if __name__ == "__main__":
    main()

Solution (Python):
import math

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

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

Solution (Python):
N = int(input())
x = (N+1) * 100 // 108
if x * 108 // 100 == N:
  print(x)
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())
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())

for x in range(N,0,-1):
    val = int(x * 1.08)
    if val == N:
        print(x)
        exit()

print(':(')

Solution (Python):
n=int(input())
for i in range(1,n+1):
    if (i *108)//100 ==  n:
        print(i)
        exit()
print(':(')

Solution (Python):
import math
N = int(input())
S = math.ceil(N / 1.08)
if S * 1.08 <= N - 1 or S * 1.08 >= N + 1:
  print(":(")
else:
  print(S)

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

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

Solution (Python):
import sys
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 10 ** 9 + 7
import math
n = I()










x = n / 1.08
c_x = math.ceil(x)

f_n = math.floor(c_x * 1.08)

if f_n == n:
    print(c_x)
else:
    print(":(")

Solution (Python):
from decimal import Decimal
N = int(input())
a = Decimal('1.08')
for x in range(N+1):
    if int(x*a) == N:
        print(x)
        exit()

print(':(')

Solution (Python):
import math

N = int(input())
raw = math.ceil(N / 1.08)
check = raw * 1.08

if int(check) == N:
  print(raw)
else :
  print(":(")

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

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

p2 = (n + 1) / 1.08
p1 = n / 1.08
if p2 > int(p2) >= p1:
    print(int(p2))
else:
    print(":(")

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

Solution (Python):



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

Solution (Python):
N = int(input())
for i in range(50000):
  if N <= i*1.08 < N + 1:
    print(i)
    break
else:
  print(":(")

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

X = N//1.08 + 1
x = math.floor(X*1.08)
if x == N:
    print(int(X))
else:
    print(':(')

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

Solution (Python):

import sys
import math

np = ":("

def solve(N: int):
    ans = math.ceil(N/ 108 * 100)
    if math.floor(ans * 1.08) != N:
        print(np)
    else:
        print(ans)
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    solve(N)

if __name__ == '__main__':
    main()

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

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

Solution (Python):
n = int(input())
flg = False
for i in range(1, n+1):
  x = int(i*1.08)
  if x == n:
    print(i)
    flg = True
    break
if not flg:
  print(':(')

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):
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):


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

    for i in range(50001):
        if int(i * 1.08) == N:
            ans = i
            break

    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):



import sys
from io import StringIO
import unittest
import math


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """432"""
        output = """400"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """1079"""
        output = """:("""
        self.assertIO(input, output)

    def test_入力例_3(self):
        input = """1001"""
        output = """927"""
        self.assertIO(input, output)


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

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


if __name__ == "__main__":
    
    resolve()

Solution (Python):
import math

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

Solution (Python):
N = int(input())
for i in range(1 , N + 1):
  x = int(i * 1.08)
  if x == N:
    print(i)
    exit()
print(':(')

Solution (Python):

import sys
input=sys.stdin.readline

import decimal

def main():
    tax = decimal.Decimal('1.08')
    n = int(input())

    for i in range(1,n+1):
        if int(i*tax)==n:
            print(i)
            exit()
        else:
            continue
    print(":(")

if __name__=="__main__":
    main()

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

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

r = n % 27
if r == 13 or r == 26:
    print(':(')
elif r ==0:
    x = int(100*n/108)
    print(x)
else:
    for i in range(1, 25):
        if 1.08*(i-1) < r <= 1.08*i:
            break
    x = int(100*(n - i)/108) + i
    print(x)

Solution (Python):
from decimal import *

N = int(input())

X = (N / Decimal('1.08')).quantize(Decimal('0'), rounding=ROUND_UP)
if int(X * Decimal('1.08')) == N:
    print(int(X))
else:
    print(':(')

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

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

if all(int(i*1.08)!=N for i in range(N+1))==True:
    print(":(")

Solution (Python):

N = int(input())
ans = ':('
for x in range(50000):
    if (108*x)//100==N:
        ans = x
        break
print(ans)

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

if n/1.08==n//1.08:
    print(n//1.08)
elif int(-(-n//1.08) * 1.08) == n:
    print(int(-(-n//1.08)))
else:
    print(':(')

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

for i in range(1,N+1):
  if (i*108)//100==N:
    print(i)
    exit()

print(':(')

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

Solution (Python):
import math

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

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

if ans != -1:
    print(ans)
else:
    print(":(")

Solution (Python):
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


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

    def solve():
        for i in range(100001):
            cur = i * 108 // 100
            if cur == N:
                return i
        return ":("

    print(solve())


if __name__ == '__main__':
    main()

Solution (Python):

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(':(')

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

Solution (Python):
from math import ceil,floor
N=int(input())
K=ceil(N/1.08)
if floor((K-1)*1.08)==N:
  print(K-1)
if floor(K*1.08)==N:
  print(K)
else:
  print(':(')

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

Solution (Python):
from sys import stdin
from math import ceil, floor
n=int(stdin.readline().rstrip())
min_ = n/1.08
max_ = (n+1)/1.08
if float(max_).is_integer():
    if ceil(min_) == floor(max_)-1:
        print(ceil(min_))
    else:
        print(":(")
else:
    if ceil(min_) == floor(max_):
        print(ceil(min_))
    else:
        print(":(")

Solution (Python):
N = int(input())
 
ans = ":("
 
for X in range(N+1):
  if int(X * 1.08) == N:
    ans = X
    break
    
print(ans)

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

Solution (Python):

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

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

Solution (Python):
import math

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

Solution (Python):
import math


n = int(input())
o = n / 1.080

o_floor = math.floor(o)
o_ceil = math.ceil(o)

if math.floor(o_floor * 1.08) == n:
    print(o_floor)

elif math.floor(o_ceil * 1.08) == n:
    print(o_ceil)

else:
    print(':(')

Solution (Python):
import math


n = int(input())
o = n / 1.080

o_floor = math.floor(o)
o_ceil = math.ceil(o)

if math.floor(o_floor * 1.08) == n:
    print(o_floor)

elif math.floor(o_ceil * 1.08) == n:
    print(o_ceil)

else:
    print(':(')

Solution (Python):
import math


n = int(input())
o = n / 1.080

o_floor = math.floor(o)
o_ceil = math.ceil(o)

if math.floor(o_floor * 1.08) == n:
    print(o_floor)

elif math.floor(o_ceil * 1.08) == n:
    print(o_ceil)

else:
    print(':(')

Solution (Python):
import math as m

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

Solution (Python):

from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2


def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


def lcm(a, b):
    g = gcd(a, b)
    return a / g * b


def solve():
    N = int(input())
    for x in range(60000):
        if int(x * 1.08) == N:
            print(x)
            return

    print(":(")
    return


def main():
    solve()


if __name__ == '__main__':
    main()

Solution (Python):
import math

n = int(input())

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

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

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

for x in range(50000):
    if x * 108 // 100 == N:
        print(x)
        break
else:
    print(':(')

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

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

Solution (Python):
N = int(input(""))
ans = int(N/1.08)-1
f = 0
while ans < (N/1.08)+1:
    if int(ans*1.08) == N:
        print(ans)
        f += 1
    ans += 1
if f == 0:
    print(":(")

Solution (Python):
import math

n = int(input())

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

Solution (Python):
from math import ceil


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

    min_value = n * 100 / 108
    max_value = (n + 1) * 100 / 108

    candidate = ceil(min_value)

    if candidate < max_value:
        print(candidate)
    else:
        print(":(")


if __name__ == "__main__":
    main()

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

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


if __name__ == "__main__":
    main()

Solution (Python):
import math
n = float(input())
m_low = math.ceil(n / 1.08)
m_high = math.floor((n+1)/1.08)
if m_low > m_high:
  print(':(')
else:
  ch_low = math.floor(m_low*1.08)
  ch_high = math.floor(m_high*1.08)
  if ch_low == int(n):
    print(m_low)
  elif ch_high == int(n):
    print(m_high)
  else:
    print(':(')

Solution (Python):
n=int(input())
m=round(n/1.08)
if int(m*1.08)==n:
  print(m)
  exit()
else:
  if int((m-1)*1.08)==n:
    print(m-1)
    exit()
  elif int((m+1)*1.08)==n:
    print(m+1)
    exit()
  else:
    print(':(')
    exit()

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

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

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

    n += 1

print(':(')

Solution (Python):
a=int(input())
b=0
for i in range(a+1):
  c=i
  c+=(i*8)//100
  if c==a:
    b=i
print(":("if b==0 else b)

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

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

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

Solution (Python):
n = int(input())
a = int(n//1.08)
for x in range(a, a+2):
  if x < (n + 1)/1.08 and x >= n/1.08:
    print(x)
    exit()
print(':(')

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

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

Solution (Python):
"""Boot-camp-for-Beginners_Easy004_B_Tax-Rate_25-August-2020.py"""
import numpy as np
import sys

N=int(input())
X=N/1.08
if int(int(np.ceil(X))*1.08)==N:
    print(int(np.ceil(X)))
else:
    print(":(")

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

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

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

Solution (Python):
import math
f = True
N = int(input())
for i in range(N+1):
    if math.floor(i*1.08) == N:
        print(i)
        f = False
        break
if f:
    print(":(")

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

Solution (Python):
n=int(input())
if (n+1)//1.08 != n//1.08:
  res = int((n+1.08)//1.08)
  print(res)
else:
  print(':(')

Solution (Python):
import math

n = int(input())

price = n / 1.08

if int(math.ceil(price) * 1.08) == n:
	print(math.ceil(price))
elif int(math.floor(price) * 1.08) == n:
	print(math.floor(price))
else:
	print(":(")

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

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


for i in range(N+1):
    X = i * 1.08
    if int(X) == N:
        print(i)
        exit()

print(':(')

Solution (Python):
import math
n=int(input())
r1=math.ceil(n/1.08)
r2=(n+1)/1.08
if r1<r2:
    print(r1)
else:
    print(":(")

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

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

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

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

for i in range(50000):
  if math.floor(i*1.08) == n:
    print(i)
    exit()
    
print(":(")

Solution (Python):
import bisect,collections,copy,itertools,math,string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip.split())
def main():
    n = I()
    dic = collections.defaultdict(lambda : ":(")
    for i in range(1,46300):
        tax = i*108//100
        dic[tax] = i
    print(dic[n])
main()

Solution (Python):
import sys
def I(): return int(sys.stdin.readline().rstrip())

N = I()
for i in range(50000):
    if i*27//25 == N:
        print(i)
        break
else:
    print(':(')

Solution (Python):
N = int(input())
X = -(-N//1.08)
n = X*108//100
if(int(N)==int(n)):
  print(int(X))
else:
  print(':(')

Solution (Python):
import math

n=int(input())

num=math.ceil(n/1.08)

if math.floor(num*1.08)==n:
  print(num)
else:
  print(":(")

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

for X in range(N//2, N+1):
  n = (X*108)//100
  if n==N:
    print(X)
    break
  elif n > N:
    print(":(")
    break

Solution (Python):
import math
n = int(input())
for i in range(50000):
  if math.floor(i*1.08)==n:
    print(i)
    exit()
print(':(')

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

Solution (Python):


import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

n = I()
for i in range(10**6+1):
    if (i * 108) // 100 == n:
        print(i)
        quit()
print(":(")

Solution (Python):

N = int(input())


ans = -1
for i in range(1, N + 1):
	if int(i * 1.08) == N:
		ans = i


if ans != -1:
	print(ans)
else:
	print(":(")

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inl = lambda: [int(x) for x in sys.stdin.readline().split()]
ins = lambda: sys.stdin.readline().rstrip()


def solve():
    n = ini()
    for x in range(n + 1):
        y = int(x * 1.08 + 1e-8)
        if y == n:
            return x
    return ":("


print(solve())

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

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

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

Solution (Python):
import math
price = int(input())
tax = 8
price_1 = math.ceil(price / (1 + tax / 100))
price_2 = math.floor(price_1 * tax / 100)
print(price_1 if price == price_1 + price_2 else ':(')

Solution (Python):
import math


N = int(input())


X = math.ceil(N / 1.08)


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

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

tmp = int(n/1.08)
ans_lists = [tmp + i for i in range(2)]
ans = 0
for j in ans_lists:
    if int(j*1.08) == n:
        ans = j
        break
    else:
        ans = ':('

print(ans)

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

for i in range(1,n+1):
    if int(i*1.08)==n:
        res=i
if res != 0:
    print(res)
else:
    print(":(")

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

Solution (Python):
n=int(input())
ans=0
for i in range(1,50000+1):
    z=i*1.08
    if n<=z<(n+1):
        ans=i
        break
if ans==0:
    print(":(")
else:
    print(ans)

Solution (Python):
from math import ceil, floor

def resolve():
  N = int(input())
  tax = 0.08

  if floor(ceil(N/(1+tax))*(1+tax)) == N:
    print(ceil(N/(1+tax)))
  else:
    print(":(")

if __name__ == "__main__":
  resolve()

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

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

Solution (Python):
N = int(input())
a = int(N / 1.08) 
b = int((N + 1)  / 1.08) 
ans = ':('
for i in range(a, b + 1):
    if int(i * 1.08) == N:
        ans = i
        break
print(ans)

Solution (Python):
import sys
from collections import deque
import numpy as np
import math
sys.setrecursionlimit(10**6)
def S(): return sys.stdin.readline().rstrip()
def SL(): return map(str,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def IL(): return map(int,sys.stdin.readline().rstrip().split())

def solve():
    f = math.ceil(n/1.08)
    if math.floor(f*1.08)==n:
        print(f)
    else:
        print(':(')
    return

if __name__=='__main__':
    n = I()
    solve()

Solution (Python):
import math
N=int(input())
if (N/1.08).is_integer()==True:
    S=int(N/1.08)
else:
    S=math.ceil(N/1.08)
if (S*1.08)//1==N:
    print(S)
else:
    print(':(')

Solution (Python):
import math
a = int(input())
for i in range(50001):
    if math.floor(i*1.08) == a:
        print(i)
        exit()
print(":(")

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

for i in range(1, 50000):
    pay = int(i*1.08)
    if pay == N:
        print(i)
        break
    elif pay > N:
        print(':(')
        break

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

prime_cost = int(price / 1.08)

if (prime_cost * 1.08)//1 == price:
      print(prime_cost)
elif ((prime_cost + 1) * 1.08)//1 == price:
      print(prime_cost + 1)
else:
      print(":(")

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

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

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

Solution (Python):
n = int(input())
ans = -1
for k in range(n, 0, -1):
    if n == k * 108 // 100:
        ans = k
        break
if ans > 0: print(ans)
else: print(':(')

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

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

Solution (Python):
import sys
import itertools

import time
import math
import heapq
from collections import defaultdict
from collections import Counter
sys.setrecursionlimit(10 ** 7)
 
INF = 10 ** 18
MOD = 10 ** 9 + 7
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines



N = int(input())
for x in range(1, N + 1):
    val = x * 108
    val -= val % 100
    if val == N * 100:
        print(x)
        exit()
print(":(")

Solution (Python):
import math
N = int(input())
flag = True
for i in range(N):
  x = math.floor((i+1)*1.08)
  if (x == N):
    print(i+1)
    flag = False
    break
if (flag):
  print(':(')

Solution (Python):
n = int(input())
x = n * 100 // 108

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

Solution (Python):
import math
def taxr(n):
	x = math.ceil(n / 1.08)
	if int(x * 1.08) == n:
		return x
	else:
		return ':('
n = int(input())
print(taxr(n))

Solution (Python):
import math


def resolve():
    import sys
    input = sys.stdin.readline
    row1 = [int(x) for x in input().rstrip().split(" ")]
    s = row1[0]

    x = int(s / 1.08)

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



if __name__ == "__main__":
    resolve()

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