Problem:
 Score : 100 points    Problem Statement Snuke has a favorite restaurant.  The price of any meal served at the restaurant is 800 yen (the currency of Japan), and each time a customer orders 15 meals, the restaurant pays 200 yen back to the customer.  So far, Snuke has ordered N meals at the restaurant.
Let the amount of money Snuke has paid to the restaurant be x yen, and let the amount of money the restaurant has paid back to Snuke be y yen.
Find x-y .      Constraints  1 ≤ N ≤ 100         Input The input is given from Standard Input in the following format:  N       Output Print the answer.        Sample Input 1 20      Sample Output 1 15800  So far, Snuke has paid 16000 yen, and the restaurant has paid back 200 yen. Thus, the answer is 15800 .       Sample Input 2 60      Sample Output 2 47200  Snuke has paid 48000 yen for 60 meals, and the restaurant has paid back 800 yen.

Solution (Python):
def restaurant(N: int) -> int:
    x = 800 * N
    y = 200 * (N // 15)
    return x - y


if __name__ == "__main__":
    N = int(input())
    ans = restaurant(N)
    print(ans)

Solution (Python):
import sys
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def POW(x, y):
    if y == 0:
        return 1
    elif y == 1:
        return x
    elif y % 2 == 0:
        return POW(x, y // 2) ** 2 % MOD
    else:
        return POW(x, y // 2) ** 2 * x % MOD
def mod_factorial(x, y): return x * POW(y, MOD - 2) % MOD
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return input()
from functools import reduce

def main():
    N = II()
    x = 800 * N
    y = 200 * (N // 15)
    ans = x - y
    return ans

print(main())

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

print(800*n-200*(n//15))

Solution (Python):
N = int(input())
x = 800 * N
y = N // 15 * 200
print(x - y)

Solution (Python):
N=int(input());print(800*N-N//15*200)

Solution (Python):
import math
n = int(input())
ans = n * 800
ans -= 200 * math.floor(n / 15)
print(ans)

Solution (Python):


n = int(input())

print(n*800-(n//15)*200)

Solution (Python):
x=int(input())*800
print(x-x//12000*200)

Solution (Python):
def I_N():
	return int(input())

def I_N_S():
	return map(int, input().split())

N = I_N()
print(N*800 - (N//15)*200)

Solution (Python):
N=int(input())
print(N*800-(N//15)*200)

Solution (Python):
N=int(input())
print(N*800-(int(N/15))*200)

Solution (Python):
n = int(input())
a = n * 800
b = (n//15) * 200
print(a-b)

Solution (Python):
n = int(input());print(n*800 - n//15*200)

Solution (Python):
n=int(input())
print(800*n-200*(n//15))

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

x = N*800
y = (N//15)*200
print(x-y)

Solution (Python):

n = int(input())
x = 800 * n 
y = 200 * (n // 15)
print(x - y)

Solution (Python):
n=int(input())
print(800*n-n//15*200)

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

import math
x = 800 * N
y = 200 * (math.floor(N / 15))

print(x - y)

Solution (Python):
n = int(input())
s = n//15
print(800*n-200*s)

Solution (Python):
N=int(input())
x=N*800
y=(N//15)*200
ans=x-y
print(ans)

Solution (Python):
N = int(input())
x = 800*N
y = 200*(N//15)
print(x-y)

Solution (Python):
x=int(input());print(800*x-x//15*200)

Solution (Python):
n=int(input())
print(800*n-200*(n//15))

Solution (Python):
n = int(input())
x = 800 * n
y = n // 15 * 200
print(x - y)

Solution (Python):
x=int(input())
print(x*800-(x//15)*200)

Solution (Python):
N = int(input())
x = N*800
y = int(N/15)*200
print(x-y)

Solution (Python):
N = int(input())
print(800*N - N//15*200)

Solution (Python):

N = int(input())
print(800 * N - 200 * (N // 15))

Solution (Python):
n = int(input())
print(800*n - (n//15)*200)

Solution (Python):
N=int(input())
x=800*N
y=200*(N//15)
z=x-y
print(z)

Solution (Python):
n = int(input())
sub = n // 15
print(n*800 - sub*200)

Solution (Python):
N = int(input())
print(800 * N - 200 * (N // 15))

Solution (Python):
N = int(input())
print(N*800-(N//15)*200)

Solution (Python):
def main():
    N = int(input())
    print(800 * N - N//15 * 200)


if __name__ == "__main__":
    main()

Solution (Python):
a=int(input())
print(a*800-200*(a//15))

Solution (Python):
n=int(input())
print(n*800-(n//15)*200)

Solution (Python):
N = int(input())
x = 800*N
y = 200*(N//15)
print(int(x-y))

Solution (Python):
x=int(input());print(x*800-x//15*200)

Solution (Python):
x=int(input())
print(x*800-x//15*200)

Solution (Python):

n = int(input())
back = n // 15
print(800 * n - 200 * back)

Solution (Python):

n = int(input())
print(800*n - int(n/15)*200)

Solution (Python):
N=int(input())
print(str(800*N-200*(N//15)))

Solution (Python):
N = int(input())
x = N * 800
y = N // 15 * 200
print(x - y)

Solution (Python):

from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007


def A():
    n = II()
    ans = n * 800
    print(ans-(n//15)*200)
    return


def B():
    return


def C():
    return


def D():
    return


def E():
    return


def F():
    return


def G():
    return


def H():
    return


if __name__ == '__main__':
    A()

Solution (Python):

from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = SR()
    return l
mod = 1000000007


def A():
    n = I()
    print(n*800-200*(n//15))


def B():
    return


def C():
    return


def D():
    return


def E():
    return


def F():
    return


def G():
    return


def H():
    return

def J():
    return

def K():
    return


if __name__ == "__main__":
    A()

Solution (Python):
n = int(input())
x = 800*n
y = 200*(n//15)
print(x-y)

Solution (Python):
def main() -> None:
    N = int(input())
    print(800 * N - N // 15 * 200)


if __name__ == '__main__':
    main()

Solution (Python):
n=int(input())
print(800*n-200*(n//15))

Solution (Python):
n = int(input())
print(n * 800 - (200 * (n//15)))

Solution (Python):
n=int(input())
print(n*800-(n//15)*200)

Solution (Python):
n=int(input())
print(n*800-n//15*200)

Solution (Python):
N = int(input())
print(N*800 - (N//15) * 200)

Solution (Python):
a = int(input())
x = a*800
n = int(a/15)
y = n*200
print(int(x-y))

Solution (Python):
N=int(input())
print(N*800-(N//15)*200)

Solution (Python):
N = int(input())
print(N*800-(N//15)*200)

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

x = n * 800
y = (n // 15) * 200

print(x - y)

Solution (Python):

N = int(input())
svc = int(N/15)*200 
print(N*800 - svc)

Solution (Python):
N = int(input())
print((N*800)-((N//15)*200))

Solution (Python):
N = int(input())
print(N*800-(int(N/15)*200))

Solution (Python):
N = int(input())
ans = 800*N - 200*(N//15)
print(ans)

Solution (Python):
a=int(input())
q=a*800-(a//15)*200
print(q)

Solution (Python):
n = int(input())
print(800*n - int(n/15)*200)

Solution (Python):
N = int(input())
a = N // 15
ans = 800 * N - 200 * a
print(ans)

Solution (Python):

import sys

def main():
	n = int(input())
	
	yen = n * 800
	wari = (n // 15) * 200
	
	print(yen - wari)
	
if __name__ == "__main__":
	main()

Solution (Python):
n=int(input())
print(n*800-(n//15)*200)

Solution (Python):
N=int(input())
print(800*N-N//15*200)

Solution (Python):
from sys import stdin
n =int(stdin.readline().rstrip())
print(n*800 - (n//15)*200)

Solution (Python):
N = int(input())
y = N // 15 * 200

print ((N * 800) - y)

Solution (Python):
N=int(input())
print(N*800-N//15*200)

Solution (Python):
N = int(input())
print(N*800-N//15*200)

Solution (Python):
N = int(input())
x = N * 800
y = (N // 15) * 200
print(x - y if N >= 15 else x)

Solution (Python):
n = int(input())
print(n*800-n//15*200)

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

x = 800*N
y = N//15*200

print(x-y)

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

print(n*800 - (n//15)*200)

Solution (Python):
n = int(input())
print(800 * n - 200 * (n // 15))

Solution (Python):
n=int(input())
print(n*800-n//15*200)

Solution (Python):
N = int(input())
x = N*800
y = int(N/15)*200
print(x-y)

Solution (Python):
n = int(input())
print(800*n-200*(n//15))

Solution (Python):
n=int(input())
print(n*800-200*(n//15))

Solution (Python):

n = int(input())
print(n * 800 - n // 15 * 200)

Solution (Python):
N=int(input())
print (int((N*800-int(N/15)*200)))

Solution (Python):
n=int(input())
print(800*n-200*(n//15))

Solution (Python):
N=int(input())
print(N*800-int(N/15)*200)

Solution (Python):

n=int(input())

ans = n * 800 - (n//15 *200)
print(ans)

Solution (Python):

"""A-Restaurant"""

def main():
    N = int(input())
    bill = N * 800
    bill = bill - (N // 15) * 200
    print(bill)


if __name__ == '__main__':
    main()

Solution (Python):
a=int(input())
print(a*800 -int(a/15) * 200)

Solution (Python):
n = int(input())
print(n*800 - n // 15 * 200)

Solution (Python):
N = int(input())
print(N * 800 - N // 15 * 200)

Solution (Python):
a=int(input())
print(800*a-200*(a//15))

Solution (Python):
N = int(input())
print(N*800 - 200*(N//15))

Solution (Python):
n=int(input());print(n*800-200*(n//15))

Solution (Python):
C = 800
K = 15
B = 200
N = int(input())
x = N * C
y = (N // 15) * 200
print(x-y)

Solution (Python):
def fun():
     print('ac')
     print('ac')
     print('ac')
     print('ac')
N=eval(input())
result=N*800-(N//15)*200
print(result)

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

x = 800 * N
y = 200 * (N // 15)
ans = x - y

print(ans)
print()

Solution (Python):
n = int(input())
print(n*800 - (n//15)*200)

Solution (Python):
n = int(input())
print(n*800 - n//15*200)

Solution (Python):
n = int(input())
print(n*800-(n//15)*200)

Solution (Python):
n = int(input())
print(n*800-200*(n//15))

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

print(800 * N - 200 * (N // 15))

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

sum = (800 * n)-math.floor(n/15) * 200
print(sum)

Solution (Python):
N=input()
print N*800-N/15*200

Solution (Python):
N=int(input())
d=N//15
print(800*N-200*d)

Solution (Python):
n=int(input())
print(n*800-200*(n//15))

Solution (Python):
N = int(input())
print(800*N - (N//15)*200)

Solution (Python):
n=int(input())
print(800*n-n//15*200)

Solution (Python):
n=int(input())
print(800*n-200*(n//15))

Solution (Python):
n = int(input())
print(800*n-n//15*200)

Solution (Python):
n=int(input())
print(n*800-n//15*200)

Solution (Python):
import math
n=int(input())
print(n*800-200* math.floor(n/15))

Solution (Python):
a=int(input())
print(800*a-200*(int(a/15)))

Solution (Python):
N = int(input())
print(N*800-(N//15)*200)

Solution (Python):
N = int(input())
print(N*800 - N//15*200)

Solution (Python):
n = int(input())
print(n*800-n//15*200)

Solution (Python):
n = int(input())
ans = 800*n - (n//15)*200
print(ans)

Solution (Python):
N = int(input())
print(800 * N - 200 * (N // 15))

Solution (Python):
n=int(input())
print(800*n-(int(n/15)*200))

Solution (Python):
a = int(input())
print(a*800-(int(a/15)*200))

Solution (Python):
n=int(input())
print(n*800-(n//15)*200)

Solution (Python):
n = int(input())
print(800*n - 200*(n//15))

Solution (Python):
print((lambda x=input(): int(x) * 800 if int(x) < 15 else (int(x) * 800 - (200) * int(int(x) / 15)))())

Solution (Python):
""" AtCoder """

N = int(input())

print(800*N - 200*int(N/15))

Solution (Python):
n = int(input())
print(n//15*11800+n % 15*800)

Solution (Python):
n=int(input())
print(800*n-200*(n//15))

Solution (Python):
n = int(input())
print((n * 800) - (n // 15 * 200))

Solution (Python):
N = int(input())
x = 800*N
y = N//15 *200
print(x-y)

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

x = N * 800
y = N // 15 * 200

print(x - y)

Solution (Python):
n = int(input())
x = 800 * n
y = (int)(n / 15) * 200
print(x - y)

Solution (Python):
n = int(input())
print(800*n - 200*(n//15))

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

print(800 * N - 200 * (N // 15))

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

print(n * 800 - n // 15 * 200)

Solution (Python):
N = int(input())
print(800*N - N//15*200)

Solution (Python):
N = int(input())
print(N*800-N//15*200)

Solution (Python):
n = int(input())
print (800*n-200*(n//15))

Solution (Python):


import sys


INF = float('inf')
MOD = 10 ** 9 + 7

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return input()


n = II()

print(n * 800 - n // 15 * 200)

Solution (Python):
n=int(input())
print(800*n-int(n/15)*200)

Solution (Python):
a=int(input())
print((8*a-2*(a//15))*100)

Solution (Python):
N = int(input())
print(N*800 - int(N/15)*200)

Solution (Python):
N = int(input())
print(800*N - N//15*200)

Solution (Python):
N=int(input())
x=0
y=0
for i in range(1,N+1):
    x+=800
    if i%15==0:
        y+=200
print(x-y)

Solution (Python):
N = int(input())
print(800*N-(N//15)*200)

Solution (Python):
n=int(input())
print(n*800-200*(n//15))

Solution (Python):
x=int(input())
print(x*800-200*(x//15))

Solution (Python):
n = int(input())
print((n * 800) - (n // 15) * 200)

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

print((int_n * 800)  - ((int_n // 15) * 200))

Solution (Python):
N = int(input())
print(N*800 - (N//15)*200)

Solution (Python):
n = int(input())
print(n * 800 - (n // 15) * 200)

Solution (Python):
N = int(input())
syo = N // 15 
amari = N % 15
x = (15 * 800) * syo + 800 * amari
y = 200 * syo
print(x - y)

Solution (Python):
N = int(input())
print(N * 800 - (N // 15) * 200)

Solution (Python):
a = int(input())
print(800*a-200*(a//15))

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

ans = int(n/15)

print(n*800 - ans*200)

Solution (Python):
N = int(input())
print(800 * N - 200 * (N // 15))

Solution (Python):
N = int(input())
cashback = N // 15
print(N*800-cashback*200)

Solution (Python):
n=int(input())
ans=n*800-n//15*200
print(ans)

Solution (Python):
print(sum([800-200 if i%15==0 else 800 for i in range(1,int(input())+1)]))

Solution (Python):
N=int(input())
print(800*N-200*(N//15))

Solution (Python):
N = int(input())
x = 800 * N
y = 200 * (N // 15)
print(x - y)

Solution (Python):
N=int(input())
print(800*N - 200*(N//15))

Solution (Python):
N=int(input())
print(N*800-(N//15)*200)

Solution (Python):
N = int(input())
P,Q = divmod(N, 15)
print(N*800-P*200)

Solution (Python):
N = int(input())
x = N * 800
y = (N//15)*200
print(x - y)

Solution (Python):
def main():
    n = int(input())
    print(n * 800 - (n // 15) * 200)


if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
print(800*n-200*(n//15))

Solution (Python):


def main():
    
    a = int(input())
    print(800*a-(int(a/15)*200))

if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
print(800 * n - 200 * (n // 15))

Solution (Python):
a=int(input())
print(800*a-200*(a//15))

Solution (Python):
from statistics import mean, median,variance,stdev
import sys
import math

x = input().split()

a = []
for i in range(len(x)):
   a.append(int(x[i]))

print(int(a[0]*800-200*int(a[0]/15)))

Solution (Python):
n = int(input())
print(n * 800 - (n // 15) * 200)

Solution (Python):
n=int(input())
print(n*800-200*(n//15))

Solution (Python):
N=int(input())
x=int(N*800)
y=int(N//15*200)
print(x-y)

Solution (Python):
n = int(input())
print(800 * n - 200 * (n // 15))

Solution (Python):
n=int(input())
print(n*800-(n//15)*200)

Solution (Python):



def main():
    """Function."""
    n = int(input())
    print(800 * n - 200 * (n//15))


if __name__ == "__main__":
    main()

Solution (Python):

N = int(input())
M = N * 800 
L = int(N // 15) 
print("{}".format(M - 200*L))

Solution (Python):
n = int(input())
x = 800 * n
y = 200 * (n // 15)
print(x - y)

Solution (Python):
N = int(input())
x = 800 * N
y = 200 * int(N / 15)
print(x - y)

Solution (Python):
N = int(input())
x = 800 * N
y = 200 * (N // 15)
ans = x - y
print(ans)

Solution (Python):
N = int(input())
x = N*800
y = (N//15)*200
print(x-y)

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

print(800*N-int(N/15)*200)

Solution (Python):
n = int(input())
print(800 * n - 200 * (n // 15))

Solution (Python):
import sys

N = int(sys.stdin.readline().strip())

print(800*N - int(N/15)*200)

Solution (Python):
n = int(input())
i = n//15
x = n*800
y = i*200
print(x-y)

Solution (Python):
N = int(input())
print(800*N-200*(N//15))

Solution (Python):
n = int(input())
print(n*800-int(n/15)*200)

Solution (Python):
n = int(input())
print(n*800-round(int(n/15)*200))

Solution (Python):
N = int(input())
print((800*N) - ((N//15)*200))

Solution (Python):
n=int(input())
print(n*800-n//15*200)

Solution (Python):
N = int(input())
print(800*N-200*(N//15))

Solution (Python):
n = int(input())
print(n*800 - n//15*200)

Solution (Python):
N=int(input())
print(str(800*N-200*int(N/15)))

Solution (Python):
count = int(input())
print(800*count -200*(count//15))

Solution (Python):
N = int(input().rstrip())
x = 800 * N
y = int(N / 15) * 200
print(x - y)

Solution (Python):
N=int(input())
x=800*N
y=200*(N//15)
print(x-y)

Solution (Python):
n = int(input())
x = n*800
y = n//15 * 200
print(x-y)

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

b=(a*800)-(int(a/15)*200)

print(b)

Solution (Python):
import sys
import math
import collections
import itertools
import array
import inspect


sys.setrecursionlimit(1000000)



def chkprint(*args):
    names = {
        id(v): k
        for k, v in inspect.currentframe().f_back.f_locals.items()
    }
    print(', '.join(
        names.get(id(arg), '???') + ' = ' + repr(arg) for arg in args))



def to_bin(x):
    return bin(x)[2:]


def li_input():
    return [int(_) for _ in input().split()]


def gcd(n, m):
    if n % m == 0:
        return m
    else:
        return gcd(m, n % m)


def gcd_list(L):
    v = L[0]

    for i in range(1, len(L)):
        v = gcd(v, L[i])

    return v


def lcm(n, m):
    return (n * m) // gcd(n, m)


def lcm_list(L):
    v = L[0]

    for i in range(1, len(L)):
        v = lcm(v, L[i])

    return v



def wfs_d(D, N, K):
    """
    D: 隣接行列(距離付き)
    N: ノード数
    K: 始点ノード
    """

    dfk = [-1] * (N + 1)
    dfk[K] = 0

    cps = [(K, 0)]
    r = [False] * (N + 1)
    r[K] = True
    while len(cps) != 0:
        n_cps = []
        for cp, cd in cps:
            for i, dfcp in enumerate(D[cp]):
                if dfcp != -1 and not r[i]:
                    dfk[i] = cd + dfcp
                    n_cps.append((i, cd + dfcp))
                    r[i] = True

        cps = n_cps[:]

    return dfk



def dfs_d(v, pre, dist):
    """
    v:  現在のノード
    pre: １つ前のノード
    dist: 現在の距離

    以下は別途用意する
    D: 隣接リスト(行列ではない)
    D_dfs_d: dfs_d関数で用いる，始点ノードから見た距離リスト
    """

    global D
    global D_dfs_d

    D_dfs_d[v] = dist

    for next_v, d in D[v]:
        if next_v != pre:
            dfs_d(next_v, v, dist + d)

    return


def sigma(N):
    ans = 0
    for i in range(1, N + 1):
        ans += i
    return ans


def comb(n, r):
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n

    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]

    for p in range(2, r + 1):
        pivot = denominator[p - 1]
        if pivot > 1:
            offset = (n - r) % p
            for k in range(p - 1, r, p):
                numerator[k - offset] /= pivot
                denominator[k] /= pivot

    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])

    return result

def bisearch(L, target):
    low = 0
    high = len(L) - 1
    
    while low <= high:
        mid = (low + high) // 2
        guess = L[mid]
        if guess == target:
            return True
        elif guess < target:
            low = mid + 1
        elif guess > target:
            high = mid - 1
    if guess != target:
        return False



dp = None


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

    d = N // 15

    print(N * 800 - d * 200)


main()

Solution (Python):
n = int(input())
print(800*n - 200*(n//15))

Solution (Python):
x=int(input());print(x*800-x//15*200)

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

print(800 * N - 200 * (N // 15))

Solution (Python):
a = int(input())
print(a * 800 - int(a / 15)*200)

Solution (Python):
N = input()
print 800 * N - 200 * (N // 15)

Solution (Python):
n = int(input())
print(800 * n - 200 * (n // 15))

Solution (Python):
n = int(input())
print(n*800 - (n//15) * 200)

Solution (Python):
N = int(input())
x = N*800
y = (N//15)*200 
print(x-y)

Solution (Python):
N=int(input())
print(800*N-N//15*200)

Solution (Python):
N = int(input())
print(800 * N - int(N / 15) * 200)

Solution (Python):
import math
N = int(input())
r = math.floor(N / 15)
print(N * 800 - r * 200)

Solution (Python):
n = int(input())
print(n * 800 - n // 15 * 200)

Solution (Python):


n = int(input())
x = n * 800
y = n//15*200
print(int(x-y))

Solution (Python):
N = int(input())
print(800 * N - 200 * int(N / 15))

Solution (Python):
a = int(input())
b = int(a / 15)
print(int(a * 800 - b * 200))

Solution (Python):
a = int(input())
b = a // 15
print(a * 800 - b * 200)

Solution (Python):
N = int(input())
x = 800 * N
y = 200 * int(N/15)
print(x-y)

Solution (Python):
n = int(input())
print(n*800-n//15*200)

Solution (Python):
n=int(input())
b=n//15
print(800*n-200*b)

Solution (Python):
N = int(input())
ans = 800 * N - (N // 15) * 200
print(ans)

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

print(n*800 -(int(n/15))*200)

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


g = N // 15

x = N * 800
y = g * 200
print((x-y))

Solution (Python):
n=int(input())
print(800*n-(n//15)*200)

Solution (Python):
p = int(input())
print(p*800 - int(p/15)*200)

Solution (Python):
N = int(input())
lunch = 0
count = 0
for i in range(N):
    lunch += 800
    count += 1
    if count%15 == 0:
        lunch -= 200
print(lunch)

Solution (Python):
N = int(input())
print((N*800)-(N//15*200))

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

print(800*N-200*(N//15))

Solution (Python):
n = int(input())
y = n//15*200
x = 800*n

print(x-y)

Solution (Python):
n=int(input())
print(800*n-200*(n//15))

Solution (Python):
N = int( input())
print( N*800 - 200*(N//15))

Solution (Python):
n = int(input())
print(n*800 - n//15*200)

Solution (Python):
n = int(input())
print([n * 800, (n * 800) - ((n // 15) * 200)][n >= 15])

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

x = n*800
y = (n//15)*200
print(x-y)

Solution (Python):
a=int(input())
total=0
count=0
for i in range(a):
    total+=800
    count+=1
    if count%15==0:
        total-=200
print(total)

Solution (Python):
n = int(input())
x = n*800
y = (n//15)*200
print(x-y)

Solution (Python):
n = int(input())
print(n*800 - (n//15)*200)

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

discount = (n//15) * 200
print((n*800) - discount)

Solution (Python):
N = int(input())
print(N * 800 - (N//15)*200)

Solution (Python):
n = int(input())
print((n * 800) - ((n // 15) * 200) if n >= 15 else n * 800)

Solution (Python):

N = int(input())
print(800 * N - 200 * (N // 15))

Solution (Python):
n = int(input())
print(800*n - n//15*200)

Solution (Python):
n = int(input())
print(800 * n - int(n / 15) * 200)

Solution (Python):
n = int(input())
print(n*800 - n//15 *200)

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

x = 800 * n
y = int(200 * int(n / 15))

print(x - y)

Solution (Python):
n=int(input());print(n*800-n//15*200)

Solution (Python):
n = int(input())
if 15 <= n:
  print(n * 800 - (n // 15 * 200))
else:
  print(n * 800)

Solution (Python):
n=int(input());print(n*800-n//15*200)

Solution (Python):
n=int(input());print(n*800-n//15*200)

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 main():
    N = int(input())
    print(800 * N - 200 * (N // 15))


if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
print(n*800 - n//15*200)

Solution (Python):


n = input()
x = 800 * int(n)
y = 200 * int(int(n) / 15)

print(x-y)

Solution (Python):
x=int(input());print(x*800-(x//15)*200)

Solution (Python):
x = int(input())
print(x*800-(x//15)*200)

Solution (Python):
n=int(input());print(800*n-200*(n//15))

Solution (Python):
n = int(input())
print(n * 800 - n // 15 * 200)

Solution (Python):
N = int(input())
print(N*800-(N//15)*200)

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

print(N*800 - (N//15)*200)

Solution (Python):
N=int(input())
print(800*N-N//15*200)

Solution (Python):
N=int(input())
print(800*N-200*(N//15))

Solution (Python):
a=int(input())
print(a*800-a//15*200)

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

x = N * 800
y = N//15 * 200
print(x-y)

Solution (Python):
a=int(input())
print(800*a-(a//15)*200)

Solution (Python):
n=int(input());print(n*800-n//15*200)

Solution (Python):
n=int(input());print(n*800-n//15*200)

Solution (Python):
n=int(input());print(n*800-n//15*200)

Solution (Python):
n = int(input())
x = 800*n
y = 200*(n//15)
print(x-y)

Solution (Python):
n=int(input())
print(n*800-(n//15)*200)

Solution (Python):
n = int(input())
print(800 * n - (n // 15) * 200)

Solution (Python):
def main():
    N = int(input())
    prices = N * 800
    discount = (N // 15) * 200
    print(prices - discount)

if __name__ == '__main__':
    main()

Solution (Python):
n=int(input());print(n*800-n//15*200)

Solution (Python):
n=int(input());print(n*800-n//15*200)

Solution (Python):
n = int(input())
print(n*800 - n//15*200)

Solution (Python):
n = int(input())
print(800*n-200*int(n/15))

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

x = 800*N

y = 200*(N // 15)

print(x-y)

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

ynum=N//15

ans=800*N-ynum*200

print(ans)

Solution (Python):
N=int(input())
x=N*800
y=N//15*200
print(x-y)

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

x = 800*n
y = 200*(n//15)

print(x-y)

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

x = 800 * N
y = 200 * (N // 15)

print(x-y)

Solution (Python):
n = int(input())
print((n*800)-(int(n/15)*200))

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

x = 800 * n
y = n // 15 * 200

print(x - y)

Solution (Python):
n = int(input())
print(800 * n - int(n / 15) * 200)

Solution (Python):
n = int(input())
print(800*n-n//15*200)

Solution (Python):

n = int(input())
x = 800*n
y = (n//15)*200
print(x-y)

Solution (Python):
n=int(input())
print(800*n-200*(n//15))

Solution (Python):
N=int(input())
print(N*800-(N//15)*200)

Solution (Python):


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

    print(800 * n - (n // 15) * 200)

if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
print(800 * n - n // 15 * 200)

Solution (Python):
n = int(input())
x = n * 800
y = (n // 15) * 200

print(x - y)

Solution (Python):
n = int(input())
print(n*800 - (n//15)*200)

Solution (Python):
n=int(input())
print(n*800-200*(n//15))

Solution (Python):
n = int(input())
print(n * 800 - n // 15 * 200)

Solution (Python):
n = int(input())
print(800*n - 200*(n//15))

Solution (Python):
N = int(input())
print(800* N - 200 * (N//15))

Solution (Python):
N = int(input())
print(800*N-200*(N//15))

Solution (Python):
n=int(input())
print(n*800-(n//15)*200)

Solution (Python):
n = int(input())
print(800*n - 200*(n//15))

Solution (Python):
N = int(input())
print(N*800-N//15*200)

Solution (Python):
n = int(input())
print(800 * n - (n // 15) * 200)

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

print(800*n-200*(n//15))

Solution (Python):

n=int(input())
count=800*n-200*int(n/15)
print(count)

Solution (Python):
n = int(raw_input())
print 800 * n - 200 * (n/15)

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

reward = int(n /15)

print(800*n - 200*reward)

Solution (Python):
N = int(input())
print(800 * N - 200 * (N // 15))

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

print(800*n-200*(n//15))

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

print(800 * N - (N // 15) * 200)

Solution (Python):

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

    print(n*800 - (n//15 * 200) )

if __name__ == "__main__":
        main()

Solution (Python):
n = int(input())
print(800 * n - 200 * (n // 15))

Solution (Python):
N = int(input())
print(800 * N - 200 * (N // 15))

Solution (Python):

N = int(input())

a = N // 15
b = N % 15

ans = (800 * 15 - 200) * a + 800 * b
print(ans)

Solution (Python):
def main():
    N = input()
    x = int(N) * 800
    y = int(N) // 15 * 200
    z = x - y
    print(z)

if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
print(800*n - n//15*200)

Solution (Python):
n=int(input())
print(800*n-200*(n//15))

Solution (Python):


n = int(input())
print(800*n - 200*(n//15))

Solution (Python):
n = int(input())
x = 800*n
y = (n//15)*200
print(x-y)

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

print(800*N - (N // 15) * 200)

Solution (Python):


N = int(input())

x = N * 800
y = (N // 15) * 200

print(x - y)

Solution (Python):
n=int(input())
print(800*n-200*(n//15))

Solution (Python):
n=int(input())
print(n*800-(n//15)*200)

Solution (Python):
i = int(input())
x = i * 800
y = i // 15 * 200
print(x -y)

Solution (Python):
N = int(input())
print(800 * N - (N//15) * 200)

Solution (Python):
N=int(input())
print(N*800-N//15*200)

Solution (Python):
n=int(input())
x=800*n
y=(n//15)*200
print(x-y)

Solution (Python):
N=int(raw_input())
d=N/15
print 800*N - 200*d

Solution (Python):
n=int(input())
print(800*n-(n//15)*200)

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

print(800 * n - (n // 15) * 200)

Solution (Python):
i=int(input())
print((i*800)-(i//15)*200)

Solution (Python):
n=int(input())
print(n*800-(n//15)*200)

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

x = 800*N
y = 200*(N//15)

print(x-y)

Solution (Python):
x = int(input())
print(800*x - (x//15)*200)

Solution (Python):
print(lambda x:x*800-x/15*200)(input())

Solution (Python):
N = int(input())
print(N*800-N//15*200)

Solution (Python):
n = int(input())
print('{}'.format((n*800)-(n//15)*200))

Solution (Python):
a=input()
b=int(a)
x=800*b
y=b//15*200
print(x-y)

Solution (Python):
a=int(input())
print(a*800-a//15*200)

Solution (Python):

a = int(input())
b = 800*a
c = a//15
d = 200*c
print(b-d)

Solution (Python):
n = int(input())
print(800*n-n//15*200)

Solution (Python):
N = int(input())
print(N*800 - (N//15)*200)