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):
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):
eat = int(input())
pay = 0
discount = 0
count = 0

for i in range(eat):
    pay += 800
    count += 1

    if count % 15 == 0:
        discount += 200


print(pay - discount)

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

Solution (Python):



num=int(input())
quo=num//15

x=800*num
y=200*quo

print(x-y)

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

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

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

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

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

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

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

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

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

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

Solution (Python):

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

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

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

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

print(x-y)

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

if n >= 15:
    print(800 * n - ( n // 15) * 200)
else:
    print(800 * n )

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

count = 0
y = 0
x = 0
while count != N:
    count += 1
    if count % 15 == 0:
        y += 200
    x += 800

print(x - y)

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

bonus = 0
pay = 0

for i in range(1,N+1):
    if i % 15 == 0:
        bonus += 200
    
    pay += 800
    
sum = pay - bonus

print(sum)

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 = 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())
print(a*800-a//15*200)

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

if n >= 15:
    print(n * 800 - ( n // 15 ) * 200)
else:
    print(n * 800)

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

if n >= 15:
    x = n * 800
    y = ( n // 15 ) * 200
    print(x - y)
else:
    print(n * 800)

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

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

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

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

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

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

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

answer = x - y

print(answer)

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 = 200*(N//15)
print(x-y)

Solution (Python):
import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext

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 lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
num_list = []
str_list = []

def main():
    n = i_input()

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

if __name__ == '__main__':
    main()

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

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

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

    print(x - y)


if __name__ == "__main__":
    main()

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

Solution (Python):
import math

N=int(input())

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

print(x-y)

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())
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())
x=N*800
y=int((N//15)*200)
print(x-y)

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(N*800-N//15*200)

Solution (Python):
import sys

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


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

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


if __name__ == '__main__':
    main()

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

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

x = 800 * n     


y = 0
if n >= 15:
    y = 200 * (n//15)


ans = x - y
print(ans)

Solution (Python):


N = int(input())

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

answer = x - y

print(answer)

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

ans = -200*(N//15)
ans += N*800
print(ans)

Solution (Python):
import math

N = int(input())

x = N * 800

y = math.floor((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(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(n*800-n//15*200)

Solution (Python):
input_num = int(input())
X = input_num * 800
Y = int(input_num / 15) * 200
result = X - Y

print(result)

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

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


x = input_num * 800 
y = int(input_num / 15) * 200  
result = x - y  

print(result)

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() )
x = int( 800 * N )

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

Solution (Python):

N = int( input() )
x = int( 800 * N )



y = N // 15 * 200

print( x - y )

Solution (Python):
n=int(input())
x=800*n
y=200*(n//15)
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())

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

Solution (Python):




N = int(input())

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

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

x = eat_N * 800

y = (eat_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 - (N // 15) * 200 )

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

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



x=input()
syoku=int(x)


gokei=syoku*800

if syoku // 15  != 0 :
    print(gokei-200*(syoku//15))
else :
    print(gokei)

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

x = N * 800

y = ( N // 15 ) * 200

totle = x - y

print(totle)

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

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

print(x - y)

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

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

answer = x - y

print(answer)

Solution (Python):








N = int(input())


x = 800 * N



y = int((N // 15) * 200)

answer = int(x - y)
print(answer)

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 = 800 * N
y = (N // 15) * 200

payment = x - y
print(payment)

Solution (Python):



import sys
from io import StringIO
import unittest


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 = """20"""
        output = """15800"""
        self.assertIO(input, output)

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


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

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


if __name__ == "__main__":
    
    resolve()

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

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

print(x - y)

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())
x = 800 * n
y = n // 15 * 200
print(x - y)

Solution (Python):

N=input()
1<=int(N)<=100

y=int(int(N)/15)*200

x=800*int(N)

print(int(x)-int(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 = 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 = N * 800
y = (N // 15) * 200

print(x - y)

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

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

print(x - y)

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())
x = N * 800
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())

n=800*N-(N//15)*200

print(n)

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(int(x - y))

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


if __name__ == "__main__":
    solve()

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

Solution (Python):
n=input()


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


print(x-y)

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

back = 0

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

back = x - y
print(back)

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

x = int(800 * N)

y = int((N / 15)) * 200

print(x - y)

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

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

x = N * 800

y = N // 15 * 200

print(x - y)

Solution (Python):




N = int (input ())

x = int(800 * N)


y = int(N / 15)* 200

print( x - y )

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

getmoney = eat // 15

print(eat * 800 + (getmoney * -200))

Solution (Python):
N = int( input() )
x = int( 800 * N )



y = int( N / 15 ) *200

print( x - y )

Solution (Python):








input_num = int(input())



x = input_num * 800


y = int(input_num / 15) * 200


result = x - y

print(result)

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

Solution (Python):
N = input()

x = 800*int(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(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 = int(N / 15) * 200

print(x - y)

Solution (Python):



N = int(input())

result = 0

result += 800 * N
result -= 200 * int(N / 15)

print(result)

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

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

Solution (Python):

cnt = int(input())

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

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

x = N * 800
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 = N * 800
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 = N * 800
y = N // 15 * 200
print(x - y)

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

x = N * 800
y = int(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 = N * 800
y = N // 15 * 200

print(x - y)

Solution (Python):





pay_count = int(input())

print(pay_count * 800 - ((pay_count // 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

answer = x - y

print(answer)

Solution (Python):






N = int(input())

x = N * 800


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())
if 1 <= N & N <= 100:
    count = int(N / 15)
    x = 800 * N
    y = 200 * count
    print(x - y)

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) - ((n // 15) * 200))

Solution (Python):



n = int(input())


total_pay = n * 800
total_back = (n // 15) * 200
balance = total_pay - total_back

print(balance)

Solution (Python):



n = int(input())


total_pay = n * 800
total_back = (n // 15) * 200
balance = total_pay - total_back

print(balance)

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

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

Solution (Python):
unit_price = 800
reward_money = 200

meals = int(input())

print(unit_price * meals - meals // 15 * reward_money)

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

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

Solution (Python):
unit_price = 800
reward_amount = 200

meals = int(input())

print(unit_price * meals - meals // 15 * reward_amount)

Solution (Python):






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

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

Solution (Python):

N = int(input())


Cashsum = 800 * N 
Cashback = (N // 15) * 200


print(Cashsum - Cashback)

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

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

print(x - y)

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

answer = 800 * N - ( N//15 * 200 )

print(answer)

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

y = N // 15
x = N * 800

if y >= 1:
    print( x - (y * 200))
else:
    print(x)

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

print(int(x - y))

Solution (Python):
N= int(input())
x= 800 * N
if N < 15:
    y = 0
if 15 <= N < 30:
    y = 200
if 30 <= N < 45:
    y = 400
if 45 <= N < 60:
    y = 600
if 60 <= N < 75:
    y = 800
if 75 <= N <90:
    y = 1000
if 90 <= N <=100:
    y = 1200
print(x-y)

Solution (Python):








input_num = int(input())


x = input_num * 800 
y = int(input_num / 15) * 200  
result = x - y  

print(result)

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

Solution (Python):

N = int(input())


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

answer = x - y
print(answer)

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

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

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

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

total_Money = x - y
print(total_Money)

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

x=N*800

y=N//15*200

print(x-y)

Solution (Python):



N = int(input())    

x = N * 800 

y = N // 15 * 200   

answer = x - y  

print(answer)

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


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

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

if n >= 15:
    x = n * 800
    y =( n // 15 ) * 200
    answer = x - y
    print(answer)
else:
    answer = n * 800
    print(answer)

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())
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())
x=N*800
y=(N//15)*200
print(x-y)

Solution (Python):

number = int(input())

x = 800 * number

y = number // 15 * 200

total_price = x-y
print(total_price)

Solution (Python):

N = int(input())



total_pay = 800 * N
total_get =N // 15 * 200


answer = total_pay - total_get
print(answer)

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

x=N*800

y=N//15*200

print(x-y)

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()

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

if __name__ == "__main__":
    main()

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

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

Solution (Python):

number = input()

number = int(number)

x = 800 * number

y = number // 15 * 200

total_price = x-y
print(total_price)

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

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

print(x - y)

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

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

print(x-y)

Solution (Python):


N = int(input())

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

answer = x - y

print(answer)

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

Solution (Python):






N = int(input())



x = N * 800



y = int(N / 15) * 200



answer = x - y


print(answer)

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

total_cost = num_ate_food * 800
cash_back = 0

if num_ate_food >= 15:
    cash_back = (num_ate_food // 15) * 200

total_paid = total_cost - cash_back
print(total_paid)

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-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=800*n
y=n//15*200
print(x-y)

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

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())
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())
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())
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())
tmp = N // 15
cost = 800 * N - 200 * tmp
print(cost)

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

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

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

Solution (Python):
from sys import stdin, stdout


def main() -> None:
    line = int(stdin.readline())
    x = line * 800
    tmp = line / 15
    y = int(tmp) * 200
    rta = x - y
    print(rta)


main()

Solution (Python):
from sys import stdin, stdout

def main():
    line = stdin.readline()
    parts = line.split()
    X = int(parts[0])
    x = X*800
    y = 200*int(X/15)
    stdout.write(str(x-y))

main()

Solution (Python):
from sys import stdin,stdout

def main():
    line=stdin.readline()
    parts=line.split()
    a=int(parts[0])
    b=800*a
    c=int(a/15)*200
    stdout.write(str(int(b-c)))
main()

Solution (Python):
from sys import stdin, stdout


def main():
    line = stdin.readline()
    parts = line.split()
    n = int(parts[0])
    x = 800*n
    y = (int(n/15)) * 200



    stdout.write( str(x-y))


main()

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

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

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

print(x-y)

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

ans = 800 * N - N//15*200

print(ans)

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

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


def main():
    N = int(readline())
    x = 800*N
    y = N//15*200
    print(x-y)


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

ans = 0
for i in range(1, n+1):
    ans += 800
    if i % 15 == 0:
        ans -= 200

print(ans)

Solution (Python):
a = int(input())
print(a * 800 - (a // 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 - 200 * (n// 15))

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(n*800 - n//15*200)

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

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

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

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

payback = int((n//15) * 200)
charges = 800 * n

ans = charges - payback
print(ans)

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

Solution (Python):
n = int(input())
value = n*800
down = n/15

if(int(down) >= 1):
    print(value - (int(down) * 200))
else:
    print(value)

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

cnt=N//15

ans=N*800-200*cnt

print(ans)

Solution (Python):
n = int(input())
print(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())
ans=800*n-(n//15)*200
print(ans)

Solution (Python):
from math import floor

N = int(input())

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

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

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

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

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

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

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

Solution (Python):

















import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
import numpy as np
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

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

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

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

Solution (Python):


def read_int():
    return int(input().strip())


def read_ints():
    return list(map(int, input().strip().split(' ')))


def solve():
    N = read_int()
    return N*800-(N//15)*200


if __name__ == '__main__':
    print(solve())

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 = 200 * (n // 15)
print(x - y)

Solution (Python):


def main():

    N = int(input())

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

    ans = x - y

    print(ans)


if __name__ == "__main__":
    main()

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

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

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

print(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())
print(n*800-n//15*200)

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

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

Solution (Python):
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
N = I()
print(800*N-((N//15)*200))

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    N = int(readline())
    x = N * 800
    y = (N // 15) * 200
    print(x - y)
    return


if __name__ == '__main__':
    main()

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

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

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())
x = 800*n
y  = (n//15)*200
print(x-y)

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

retu = int(N / 15)
ans = 800 * N - retu * 200

print(ans)

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

retu = int(N / 15)

ans = N * 800 - retu * 200

print(ans)

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

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

Solution (Python):
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
INF = 10**9
mod = 10**9+7

N = i()
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())
a = n *800
b = int(n/15)
c = b*200
res = a-c
print(res)

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

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

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

Solution (Python):
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right 
import sys,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))

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

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

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

ans = 0

for i in range(1, N+1):
    ans += 800
    if i%15==0: ans -= 200

print(ans)

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

if __name__ == "__main__":
  resolve()

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