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

'''
p,m=map(int,input().split())
s=bin(p)
s=s[2:]
n=len(s)


ans=pow(2,n) -1
if(m>=2):
    print(ans)
else:
    print(p)


m,n=map(int,input().split())
a=[False]*(n+1)
a[0]=True
for i in range(m):
    temp=list(map(int,input().split()))
    for kk in temp[1:]:
        a[kk]=True
ans=True
for nn in a:
    ans = nn and ans
if(ans):
    print("YES")
else:
    print("NO")



y,b,r = map(int,input().split())

if(r>b):
    if(b>y):
        print(int((3*y)+3))
    else:
        print(int(3*b))
else:
    if(b<y):
        print(int((3*y)-3))
    else:
        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())

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

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

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

Solution (Python):
import sys
input = sys.stdin.readline
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):
eat = int(input())

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

print(x-y)

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

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

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

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

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

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

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

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

y = n // 15

ans = 800*n - y*200
print(ans)

Solution (Python):


import numpy as np
import math



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

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

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

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

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

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

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

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

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):
import sys
input = sys.stdin.readline
N = int(input())
x = 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):
n=int(input())
x=800*n
y=n//15*200
print(x-y)

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

i = int(n/15)

print(800*(n) - 200*i)

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

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

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

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

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

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

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

print((800 * N) - y)

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



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

print(ans)

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

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

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

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

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

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

Solution (Python):


if __name__ == '__main__':
    N=int(input())
    x=800*N
    temp=N//15
    y=200*temp
    print(x-y)

Solution (Python):
import math
import queue
import bisect
import heapq
import time
import itertools

mod = int(1e9+7)

def swap(a,b):
    return (b,a)

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

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

def divisors(a): 
    divisors = []
    for i in range(1,int(a**0.5)+1):
        if a%i==0:
            divisors.append(i)
            if i!=a//i:
                divisors.append(a//i)
    return divisors

def is_prime(a): 
    if a<2:
        return False
    elif a==2:
        return True
    elif a%2==0:
        return False
    sqrt_num = int(a**0.5)
    for i in range(3,sqrt_num+1,2):
        if a%i==0:
            return False
    return True

def prime_num(a): 
    pn = [2]
    for i in range(3,int(a**0.5),2):
        prime = True
        for j in pn:
            if i%j==0:
                prime = False
                break
        if prime:
            pn.append(i)
    return pn

def prime_fact(a): 
    sqrt = math.sqrt(a)
    res = []
    i = 2
    if is_prime(a):
        res.append(a)
    else:
        while a!=1:
            while a%i==0:
                res.append(i)
                a //= i
            i += 1
    return res

def main():
    n = int(input())
    pay = 800 * n
    back = (n // 15) * 200
    print(pay-back)
    return

if __name__=='__main__':
    main()

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

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

Solution (Python):
a=int(input())
print(800*a-200*(a//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())
cnt = n//15
print((n*800)-(cnt*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):
食べた回数=int(input())
値段=800
ボーナス=200
支払うお金=食べた回数*値段
もらうお金=食べた回数//15 * ボーナス
     
print(支払うお金-もらうお金)

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

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

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

Solution (Python):
n = int(input().split()[0])
ans = 800 * n - 200 * (n // 15)
print(ans)

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

Solution (Python):

import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf')
ans = 0 ;count = 0 ;pro = 1

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

Solution (Python):
import sys

n = int(input())

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

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

Solution (Python):
import sys

n = int(sys.stdin.readline().rstrip())

def main():
    ans = 800 * n - 200 * (n // 15)
    return ans

if __name__ == '__main__':
    ans = main()
    print(ans)

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

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



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

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

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

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

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

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

pay = n * 800
get_count = n // 15
get = get_count * 200
print(pay - get)

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())
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
S=x-y
print(S)

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

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

x = 0
count = 0
for i in range(1, n+1):
  x += 800 
  if i%15 == 0:
    count += 1    

print(x-count*200)

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

a = n // 15

print(n*800 - a*200)

Solution (Python):
from sys import stdin
import bisect

n = int(stdin.readline().rstrip())

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

Solution (Python):

import sys
import math
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

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

def pay():
    fee = 800
    reward = 200

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

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

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

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

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

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

Solution (Python):
N = int(input())
ALL = 800 * N
TIMES = (N // 15) * 200

print(ALL - TIMES)

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

Solution (Python):
N = int(input())
sum = 800 * N
otsuri = (N // 15) * 200

print(sum - otsuri)

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

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

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

Solution (Python):
h = int(input())
x = h*800
y = (h//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(int(40/3*(n*59+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):

import math


N = int(input())

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

print (x-y)

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

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

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

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

Solution (Python):

N = int(input())

ans = N * 800
tmp = int((N // 15) * 200)

print(ans-tmp)

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

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

Solution (Python):
def examA():
    N = I()
    ans = N*800-(N//15)*200
    print(ans)



import sys
import copy
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examA()

Solution (Python):
N = int(input())
sum = 800 * N
otsuri = (N // 15) * 200

print(sum - otsuri)

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):
yen = 0

for i in range(1, int(input())+1):
    yen += 800
    
    if i%15 == 0:
        yen -= 200

print(yen)

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

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

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

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

print(s)

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

Solution (Python):

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

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

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

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

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

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

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

print(ans)

Solution (Python):

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

Solution (Python):

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

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

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

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

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

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

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())
g = n // 15

print(800*n - 200*g)

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

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

print(x-y)

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

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=0;y=0
for i in range(1,n+1):
  x+=800
for m in range(1,n+1):
  if m % 15 == 0:
    y += 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):
import sys
sys.setrecursionlimit(5 * 10**5)
input = sys.stdin.readline

N = int(input())

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

Solution (Python):
import sys
sys.setrecursionlimit(5 * 10**5)
input = sys.stdin.readline

N = int(input())

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

Solution (Python):
import sys
sys.setrecursionlimit(5 * 10**5)
input = sys.stdin.readline

N = int(input())

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

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

pay = N * 800
back = (N//15) * 200

print(pay-back)

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

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

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

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

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

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

Solution (Python):
N = int(input())
print(N*800 - 200 * int(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())
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) - ((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(open(0).read())
print(N*800-(N//15)*200)

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

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

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

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

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

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

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

Solution (Python):
def slove():
    import sys
    input = sys.stdin.readline
    n = int(input().rstrip('\n'))
    print(n * 800 - n // 15 * 200)


if __name__ == '__main__':
    slove()

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

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

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

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

Solution (Python):
import sys

input = sys.stdin.readline


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


if __name__ == "__main__":
    main()

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

print(x - y)

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

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

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

Solution (Python):
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
def do():
    n=INT()
    print(n*800-n//15*200)
if __name__ == '__main__':
    do()

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

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

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

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

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

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

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

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

price = 800
gain = 200

x = price * n - int(n / 15) * gain
print(x)

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

if n%15 == 0:
  ytime = int(n/15)
else:
  ytime = int(n/15)
  
y = 200 * ytime

print(x-y)

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


if __name__ == "__main__":
    resolve()

Solution (Python):


n = int(input())
back = n // 15

print(800 * n - 200 * back)

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)

print(x-y)

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

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

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

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

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

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
input = sys.stdin.readline

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

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


if __name__ == "__main__":
    main()

Solution (Python):

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

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

Solution (Python):
N=int(input());print(200*(4*N-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*int(N/15))

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

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

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

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

Solution (Python):
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
    
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(n*800 - n//15*200)

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

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

Solution (Python):
m = 0
x = 0
y = 0

list=[15,15*2,15*3,15*4,15*5,15*6]

n = input()
n = int(n)

while m < n:
    x = x + 800
    m = m + 1
    if m in list:
        y = y + 200

print(x-y)

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

Solution (Python):
import sys
import copy
import string
import  math
from _bisect import *
from collections import *
from operator import itemgetter
from math import factorial
"""
from fractions import gcd
def lcm(x, y):
    return (x * y) // gcd(x, y)
"""
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()

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

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

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



import sys

input = sys.stdin.readline

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

main()

Solution (Python):



import sys

input = sys.stdin.readline

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

main()

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

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

X = 800 * N
Y = 200 * (N // 15)

ans = X - Y 
print(ans)

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

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

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

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

if __name__ == '__main__':
    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(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())
print(800*n-200*(n//15))

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

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

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

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

print( ans)

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

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

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

x = n * 800

y = (n // 15) * 200

print(int(x-y))

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

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())
ans = 0
for i in range(n):
  ans += 800
  if (i+1) % 15 == 0:
    ans -= 200
print(ans)

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

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

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

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

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