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

X = N / 1.08
X1 = int(X)
X2 = X1 + 1

if N <= X1 * 1.08 < N + 1:
    print(X1)
elif N <= X2 * 1.08 < N + 1:
    print(X2)
else:
    print(':(')

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

l = []
for i in range(50001):
    l.append(int(i*1.08))

if N in l:
    print(l.index(N))
else:
    print(":(")

Solution (Python):
n = int(input())
a = 0
if n/1.08 > n//1.08:
  a = n//1.08+1

else:
  a = n//1.08


if int(a*1.08) == n:
  print(int(a))
else:
  print(":(")

Solution (Python):
import sys

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

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

    print(":(")
main()

Solution (Python):
from math import floor, ceil

N = float(input())

f1 = ceil(N / 1.08)
f2 = floor(N / 1.08)


if ceil(N / 1.08) == floor(N / 1.08):
    print(int(N / 1.08))
elif int(f1 * 1.08) == N:
    print(f1)
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())
x = math.ceil(n/1.08)
s = math.floor(x*1.08)
print(x) if s == n else print(':(')

Solution (Python):
import math

n=int(input())
mae=n/1.08
sute=math.floor(mae)
koho=[sute-2, sute-1, sute, sute+1, sute+2]
answer=-1
for k in koho:
    nedan=math.floor(k*1.08)
    if nedan==n:
        answer=k

if answer==-1:
    print(":(")
else:
    print(answer)

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

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

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

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

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

step00=int((n/108*100))
step01=int((n/108*100))-1
step02=int((n/108*100))+1





step10=int((step00/100*108))
step11=int((step01/100*108))
step12=int((step02/100*108))

nocnt=0
ok=0

if step10!=n:
  nocnt=nocnt+1
else:
    print(step00)
    ok=1


if step11!=n:
  nocnt=nocnt+1
else:
    if ok==0:
        print(step10)
        ok=1


if step12!=n:
  nocnt=nocnt+1
else:
    if ok==0:
        print(step02)
        ok=1

if nocnt>=3:
    print(':(')

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

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

if count == 0:
    print(":(")

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

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

xd = int((n/108)*100)
xu = xd + 1

if n == int(xd * 1.08):
    print(xd)
elif n == int(xu * 1.08):
    print(xu)
else:
    print(':(')

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

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

tax_rate=1.08
x = N/tax_rate
f = math.floor(x)
c = math.ceil(x)

if math.floor(f*tax_rate)==N:
	print(f)
elif math.floor(c*tax_rate)==N:
	print(c)
else:
	print(":(")

Solution (Python):
from heapq import heappush, heappop
from collections import deque
import re
import math
import functools

def sRaw():
    return input().rstrip("\r")

def iRaw():
    return int(input())


def ssRaw():
    return input().split()


def isRaw():
    return list(map(int, ssRaw()))

INF = 1 << 29


def make1d_arr(n, val=INF):
    return [val for i in range(n)]


def make2d_arr(h, w, val=INF):
    return [[val for i in range(w)]for i in range(h)]


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


def BFord(n,es):
    v_cost = [INF]*n
    v_cost[0] = 0
    for v in range(n*2):
        for e in es:
            frm = e[0]
            to = e[1]
            if v_cost[to] > v_cost[frm]+e[2]:
                v_cost[to] = v_cost[frm]+e[2]
                if v >= n:
                    v_cost[to] = -INF
        if v == n-1:
            prev = v_cost[:]
    v_cost = [-INF if prev[idx]!=v_cost[idx] else v_cost[idx] for idx in range(n)]
    return v_cost
    
def ZAlgo(s):
    l = len(s)
    A = [0]*l
    i =1
    j =0
    A[0]=l
    while i<l:
        while i+j<l and s[j] == s[i+j]:
            j+=1
        if j==0:
            i+=1
            continue
        A[i]=j
        k=1
        while (i+k<l) and (k+A[k]<j):
            A[i+k] =A[k]
            k+=1
        i+=k
        j-=k
    return A


DIV = 998244353

def main():
    N = iRaw()
    X1 = int(N/1.08)
    X2 = X1+1
    if int(X1*1.08)==N:
        return X1
    elif int(X2*1.08)==N:
        return X2
    else:
        return ":("

if __name__ == "__main__":
    print(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):
import math




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

Solution (Python):

n=int(input())

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

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

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

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

Solution (Python):
import math

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

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

Solution (Python):
import math

N = int(input())
TAX_RATE = 1.08
X = N / TAX_RATE
f = math.floor(X)
c = math.ceil(X)
if math.floor(f * TAX_RATE) == N:
    print(f)
elif math.floor(c * TAX_RATE) == N:
    print(c)
else:
    print(":(")

Solution (Python):
import math
N=int(input())
if ((N+1)/1.08).is_integer():
  X=math.floor((N+1)/1.08)-1
else:
  X=math.floor((N+1)/1.08)
if X < N/1.08:
  print(":(")
else:
  print(X)

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

while(1):
    if int(tmp * 1.08) == n:
        print(tmp)
        break
    if int(tmp * 1.08) > n:
        print(':(')
        break
    tmp += 1

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

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

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

Solution (Python):
import math as M

n = int(input())
b = M.ceil(n/1.08)

a = M.floor(b*1.08)

if a==n:
    print(b)
else:
    print(":(")

Solution (Python):
from decimal import *
N = int(input())
flag = False

for i in range(50000):
    if N == int(i * 1.08):
        print(i)
        flag = True
        break

if not flag:
    print(":(")

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

Solution (Python):
import math
x = int(input())
tax = 1.08
p_o = x/tax
p1 = math.ceil(p_o)
p2 = math.floor(p_o)


if int(p1*tax) == x or int(p2*tax) == x:
  print(p1)
else:
  print(":(")

Solution (Python):
import math

N = int(input())

d = int(N // 1.08)

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

print(':(')

Solution (Python):
def solve(n, p=1.08):
    x = int(n / p)
    for d in [-1, 0, 1]:
        y = x + d
        if int(y * p) == n:
            return y
    return ":("

n = int(input())
print(solve(n))

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

x_min = n / tax
x_max = (n + 1) / tax

for x in range(int(x_min), int(x_max) + 2):
    if n <= (x * 1.08) < n + 1:
        print(x)
        break
else:
    print(":(")

Solution (Python):



import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(1000000)
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(500001):
    if int(i*1.08) == n:
        print(i)
        break
else:
    print(':(')

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

Solution (Python):
import bisect
import heapq
import itertools
import math
import operator
import os
import re
import string
import sys
from collections import Counter, deque, defaultdict
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter, mul, add, xor

import numpy as np

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7


N = int(sys.stdin.buffer.readline())
ans = None
for i in range(N + 1):
    if int(i * 1.08) == N:
        ans = i
if ans is None:
    print(':(')
else:
    print(ans)

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

for p in [int(N/1.08), int((N+1)/1.08)]:
  if int(p*1.08) == N:
    print(p)
    exit()
print(':(')

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

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

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

Solution (Python):
n = int(input())
for x in range(50001) :
    if int(x*1.08) == n :
        print(x)
        break
else :
    print(":(")

Solution (Python):
N = int(input())
if int(int((N+0.99)/1.08)*1.08) != N:
    print(':(')
else:
    print(int((N+0.99)/1.08))

Solution (Python):
import math
n = int(input())
k = math.ceil(n/1.08)
l = math.floor((n+1)/1.08)

if k <= l and l != (n+1)/1.08:
	print(k)
else:
	print(':(')

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

X_min = N / 1.08
X_max = (N+1) / 1.08

if abs(int(X_min) - X_min) == 0.0:
    print(int(X_min))
else:
    a = int(X_min) + 1 
    if a < X_max:
        print(a)
    else:
        print(":(")

Solution (Python):

N = int(input())


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


if ans != 0:
	print(ans)
else:
	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):
N = int(input())

X = int(N / 1.08)
for x in range(X, X+20):
    if int(x * 1.08) == N:
        print(x)
        exit(0)
print(":(")

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

Solution (Python):
import math

N = int(input())
X_double = N / 1.08
if (X_double % 1) == 0:
  print(int(X_double))
else:
  X_ceil = math.ceil(X_double)
  if math.floor(X_ceil * 1.08) == N:
    print(X_ceil)
  else:
    print(':(')

Solution (Python):
N = int(input())
x = int(N / 108 * 100)
for i in range(-10, 10):
    if int((x + i) * 1.08) == N:
        print(x + i)
        exit()
print(":(")

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

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

n = int(input())

tax_excluded_round_up = math.ceil(n / 1.08)
tax_excluded_round_down = math.floor(n / 1.08)

if math.floor(tax_excluded_round_up * 1.08) == n:
	print(tax_excluded_round_up)
	exit()
if math.floor(tax_excluded_round_down * 1.08) == n:
	print(tax_excluded_round_down)
	exit()

print(":(")

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

Solution (Python):
N = int(input())
for xi in range(50000):
  n = (xi * 108 // 100) - N
  if n == 0:
    print(xi)
    break
  elif n > 0:
    print(":(")
    break

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

X = int(input())
a = math.ceil(X / 108 * 100)
b = math.floor(X / 108 * 100)

if int(a / 100 * 108) == X:
    print(a)
elif int(b / 100 * 108) == X:
    print(b)
else:
    print(':(')

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

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

Solution (Python):
N = int(input())
p = int(N / 1.08)
p1 = max(0, p - 2)
p2 = p + 2
for i in range(p1, p2 + 1):
    if int(i * 1.08) == N:
        print(i)
        break
else:
    print(':(')

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

Solution (Python):
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):
import math
N = int(input())
 
N_0 = math.ceil(N / 1.08)
M = 10
N_l = [N_0 - M + P for P in range(M*2)]
N_l_tax = [math.floor(1.08*x) for x in N_l]
 
N_l_out = []
 
for i in range(len(N_l_tax)):
  if N_l_tax[i] == N:
    N_l_out.append(N_l[i]) 
 
if len(N_l_out) != 0:
  for j in N_l_out:
    print(j)
else:
  print(':(')

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

N_0 = math.ceil(N / 1.08)
if math.floor(N_0 * 1.08) == N:
  print(N_0)
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())
x1 = int(n / 1.08)
x2 = int(n / 1.08) + 1
n1 = int(x1 * 1.08)
n2 = int(x2 * 1.08)
if n == n1:
    print(x1)
elif n == n2:
    print(x2)
else:
    print(":(")

Solution (Python):
N=int(input())
if (N+1)*100%108==0:
    print(":(")
elif 100*N%108==0 or int(N/1.08)!=int((N+1)/1.08):
    print(int((N+1)/1.08))
else:
    print(":(")

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

if math.floor(n*100//108*1.08)==n:
    print(n*100//108)
elif math.floor((n*100//108+1)*1.08)==n:
    print(n*100//108+1)
else:
    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):



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

    for x in range(1, 50000 + 1):
        if int(x * 1.08) == n:
            print(x)
            exit()

    print(':(')


if __name__ == '__main__':
    main()

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):
N = int(input())
for X in range(N+1):
    if int(X*1.08) == N:
        print(X)
        exit()

print(":(")

Solution (Python):

import sys
input = sys.stdin.readline

n = int(input())
for i in range(1, n + 10):
    a = int(i * 1.08)
    if a == n:
        print(i)
        exit()
print(":(")

Solution (Python):
import math

N = int(input())

if N % 1.08 == 0:
  print(N // 1.08)
else:
  X1 = math.floor(N / 1.08)
  X2 = X1 + 1
  Y1 = math.floor(X1 * 1.08)
  Y2 = math.floor(X2 * 1.08)
  if N == Y1:
    print(X1)
  elif N == Y2:
    print(X2)
  else:
    print(':(')

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

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

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

for i in range(1,50001):
  if i *1.08//1 == 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 math
n = int(input())
ans = 0
ng = 0
for i in range(1,50001):
    if math.floor(i*1.08) == n:
        ans = i
    else:
        continue
if ans == 0:
    print(':(')
else:
    print(ans)

Solution (Python):
import math
n = int(input())
ans = 0
for i in range(1,50001):
    if math.floor(i*1.08) == n:
        ans = i
if ans == 0:
    print(':(')
else:
    print(ans)

Solution (Python):
n=int(input())
a = n / 1.08
if a-int(a) == 0.00:
      x = int(a)
else:
      x = int(a) + 1
v = int(x * 1.08)
if v == n:
  print(x)
else:
  print(":(")

Solution (Python):
N = int(input())
M = int(N/1.08)
if int(M * 1.08) == N:
	print(M)
elif int((M+1) * 1.08) == N:
	print(M+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)
elif int((X+1)*1.08) == N:
    print(X+1)
else:
    print(":(")

Solution (Python):

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

Solution (Python):
N=int(input())
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(':(')

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

Solution (Python):
N = int(input())
X = int(N / 1.1)
while int(X * 1.08) < N:
    X += 1
if int(X * 1.08) == N : print(X)
else: print(':(')

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

ans = [x for x in range(1, N+1) if math.floor(x*1.08)==N]

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

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

if int(n//1.08) !=int((n+1)//1.08):
      print(int((n+1)//1.08))
else:
      print(':(')

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

for i in range(1,50001):
  if int(i*1.08) == N:
    print(i)
    flag = 1
  elif (flag == 0) and (i == 50000):
    print(":(")

Solution (Python):
import math

N = int(raw_input())

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

Solution (Python):
from math import floor

N = int(input())
n = int(N / 1.08)

for i in range(-2, 2):
    if floor((n + i) * 1.08) == N:
        print(n + i)
        exit()
else:
    print(':(')

Solution (Python):
def main(X):
    return_int = 0
    if X * 100 % 108 == 0:
        return int(X / 1.08)
    else:
        x = int(X / 1.08)
        for i in [x, x - 1, x + 1]:
            if int(i * 1.08) == X:
                return_int = i
                break

        if return_int != 0:
            return return_int
        else:
            return ":("



if __name__ == '__main__':
    X = int(input())
    print(main(X))

Solution (Python):
import math

N = int(input())

cand = math.floor(N / 1.08)

if cand * 1.08 >= N:
    print(cand)
elif (cand+1) * 1.08 < N+1:
    print(cand+1)
else:
    print(':(')

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

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

Solution (Python):
import math

def main():
    N = int(input())
    ans = ':('
    for i in range(N+1):
        x = int(i * 1.08)
        if x == N:
            ans = i
    print(ans)

if __name__ == "__main__":
    main()

Solution (Python):
import math

def main():
    N = int(input())
    ans = False
    for i in range(N+1):
        x = math.floor(i * 1.08)
        if x == N:
            print(i)
            ans = True
            break
    if not ans:
        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):
import math

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

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

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

n = int(input())

x = int(-(-n // 1.08))

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

Solution (Python):
import math

N = int(input())

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

Solution (Python):
import math

N = int(input())

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

Solution (Python):

import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
mod = 10**9+7


N = int(input())

from math import ceil
if ceil(N/1.08) < (N+1)/1.08:
    print(ceil(N/1.08))
else:
    print(":(")

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

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

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

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

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

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



if __name__ == '__main__':
  main()

Solution (Python):
Tax = 1.08
n = int(input())
value = int(n/Tax)
flag = True
for i in range(2):
    check_value = (value+i)*Tax
    if(int(check_value) == n):
        print(value+i)
        flag = False
if flag:
    print(":(")

Solution (Python):
import math

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

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

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

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

solve(N)

Solution (Python):
def solve():
	N = int(input())
	for x in range(int(N/1.08), int((N + 1)/1.08) + 1):
		if int(x * 108 / 100) == N:
			print(x)
			exit()
	print(':(')
solve()

Solution (Python):
import math
n=int(input())
for x in range(n+1):
    if math.floor(x*1.08)==n:
        print(x)
        exit(0)
print(':(')

Solution (Python):
import math
n=int(input())
x=(n/1.08)
for x in range(1,n+1):
    if int(1.08*x)==n:
        print(x)
        exit(0)
print(':(')

Solution (Python):
import math

N = int(input())
X = int(N / 1.08)

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

print(":(")

Solution (Python):
import math

N = int(input())

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

print(":(")

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

Solution (Python):
from sys import stdin
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
n = int(stdin.readline().rstrip())


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

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

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

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

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

Solution (Python):
import sys
from math import ceil

def main():
    n = int(sys.stdin.readline().rstrip())
    x = ceil(n / 1.08)

    res = []
    while x * 27 // 25 == n:
        res.append(x)
        x += 1
    
    if res:
        print(res[0])
    else:
        print(':(')

if __name__ == '__main__':
    main()

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

ans = N / 1.08
ans_ceil = math.ceil(ans)
ans_floor = math.floor(ans)

if math.floor(ans_ceil * 1.08) == N:
  print(ans_ceil)
elif math.floor(ans_floor * 1.08) == N:
  print(ans_floor)
else:
  print(":(")

Solution (Python):
N=int(input())
x=N/1.08
if x != int(x):x=int(x)+1
y=int(x*1.08)
if N==y:print(int(x))
else: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):
n = int(input())
p1 = n // 1.08
print(p1 if int(p1 * 1.08) == n else int(p1 + 1) if int((p1 + 1) * 1.08) == n else ':(')

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

X = N / 1.08
tax = N - X

if X.is_integer():
    X = int(X)
else:
    X = int(X) + 1

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

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

Solution (Python):
from functools import reduce
from fractions import gcd
import math
import bisect
import itertools
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
INF = float("inf")


def main():
    N = int(input())
    for x in range(1, 50001):
        if int(x*1.08)==N:
            print(x)
            return
    print(":(")


if __name__ == '__main__':
    main()

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

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

print(':(')

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

Solution (Python):


import sys
sys.setrecursionlimit(12345678)
import itertools
from collections import Counter
from collections import defaultdict
from collections import deque
import bisect
from heapq import heappush, heappop


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

    for i in range(1, n+1):
        price = int(i * 1.08)
        if price == n:
            print(i)
            return

    print(':(')

if __name__ == '__main__':
    main()

Solution (Python):

import math
X = int(input())
price = math.ceil(X * 100 / 108)


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

Solution (Python):
from sys import stdin


def main():
    N = int(stdin.readline().rstrip())

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

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


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

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

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

Solution (Python):


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

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):
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
mod2 = 998244353
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

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

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())
px_up = math.ceil(n/1.08)
px_next = (n+1)/1.08
 
if px_up < px_next:
  print(px_up)
else:
  print(":(")

Solution (Python):
import sys
from math import ceil

def main():
    n = int(sys.stdin.readline().rstrip())
    x = ceil(n / 1.08)

    res = []
    while x * 27 // 25 == n:
        res.append(x)
        x += 1
    if res:
        print(res[0])
    else:
        print(':(')

if __name__ == '__main__':
    main()

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

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

Solution (Python):
import sys 

N = int(input())

for i in range(1,50001):
  if int(i*1.08) == N:
    print(i)
    sys.exit()
    
print(":(")

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

Solution (Python):
import math

n=int(input())

x = math.floor(n /1.08)

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

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

Solution (Python):


N = int(input())

X = N / 1.08

if X - int(X) > 0:
    X = X + 1

X = int(X)


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