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

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

print(x - y)

Solution (Python):
import sys
from collections import defaultdict, deque, Counter
import math


from bisect import bisect_left, bisect_right
import heapq




input = sys.stdin.readline

getS = lambda: input().strip()
getN = lambda: int(input())
getList = lambda: list(map(int, input().split()))
getZList = lambda: [int(x) - 1 for x in input().split()]

INF = 10 ** 20
MOD = 10**9 + 7
divide = lambda x: pow(x, MOD-2, MOD)


def nck(n, k, kaijyo):
    return (npk(n, k, kaijyo) * divide(kaijyo[k])) % MOD


def npk(n, k, kaijyo):
    if k == 0 or k == n:
        return n % MOD
    return (kaijyo[n] * divide(kaijyo[n-k])) % MOD


def kaijyo(n):
    ret = [1]
    for i in range(1, n + 1):
        ret.append((ret[-1] * i)% MOD)
    return ret

def solve():

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

def main():
    n = getN()
    for _ in range(n):
        solve()


if __name__ == "__main__":
    
    solve()

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

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

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

for i in range(1,n+1):
    if i%15==0:
        y_count+=1
    
print(x-y_count*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):



from fractions import gcd
from itertools import combinations,permutations,accumulate 

from collections import deque,defaultdict,Counter
import decimal
import re












import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7

def readInts():
  return list(map(int,input().split()))
def I():
  return int(input())
n = I()
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())
ans = 800*N-200*(N//15)
print(ans)

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

Solution (Python):
import sys
from collections import defaultdict, deque, Counter
import math
 

from bisect import bisect_left, bisect_right

 

 

input = sys.stdin.readline
getS = lambda: input().strip()
getN = lambda: int(input())
getList = lambda: list(map(int, input().split()))
getZList = lambda: [int(x) - 1 for x in input().split()]
 
INF = 10 ** 20
MOD = 10**9 + 7
divide = lambda x: pow(x, MOD-2, MOD)
 
def search(pros,tgt,g,d):
    tmp = 0
    cnt = 0
    rest = []
    for i in range(d):
        if tgt % 2 == 1:
            tmp += 100 * (i+1) * pros[i][0] + pros[i][1]
            cnt += pros[i][0]
        else:
            rest.append((i+1,pros[i][0]-1))
        tgt //= 2
    
    if tmp >= g:
        return cnt
    for ap, ac in rest[::-1]:
        if tmp + 100 * ap * ac >= g:
            cnt += math.ceil((g - tmp)/(100 * ap))
            return cnt
        else:
            cnt += ac
            tmp += 100 * ac * ap

    return INF

def main():

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

 
if __name__ == "__main__":
    main()

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inm = lambda: map(int, sys.stdin.readline().split())
inl = lambda: list(inm())
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))

N = ini()


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


print(solve())

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):
import math as ma
N = int (input ())
z = ma.floor(N/15)
print (N*800 - z*200)

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

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

print(x-y)

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

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

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

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

resolve()

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

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

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

a = 800*N
b = (N // 15)*200

print(a-b)

Solution (Python):
times = int(input())
tmp = times
count = 0
while tmp >= 15:
    tmp -= 15
    count += 1
print(times * 800 - count * 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):
a=int(input())
print(a*800-a//15*200)

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

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

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

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

Solution (Python):
import sys;input = lambda : sys.stdin.readline()
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 // 15 * 11800 + 800 * (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=input()
int_N = int(N)
print(int_N*800-int(int_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())
x = 800*n
y = 200*(n//15)
print(x-y)

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

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

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

Solution (Python):

N = int(input())


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


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(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*(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):
from fractions import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations

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

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

    print(x - y)

if __name__ == '__main__':
    main()

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

x = 800 * N

y = 200 * (N // 15)

print(x-y)

Solution (Python):


n = int(input())

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

Solution (Python):
def actual(N):
    amount = 800 * N

    coupon = N // 15

    discount = 200 * coupon

    return amount - discount

N = int(input())
print(actual(N))

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

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

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

print(x - y)

Solution (Python):
import sys
import math
N = int(input())
if N < 0 or N > 100:
    sys.exit()

print(N*800 - math.floor((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())

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

print(x - y)

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

if 0 <= b:
    c = d - (200 * b)
    print(c)
else:
    print(c)

Solution (Python):
N = int(input())
a = N // 15

ans = 800*N - 200*a
print(ans)

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7


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


if __name__ == '__main__':
    resolve()

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


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


if __name__ == "__main__":
    main()

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

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

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

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

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

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

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

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

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

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

N_times=int(N_times_str)

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

Solution (Python):
N = int(input())
CB = N//15

print(800*N-200*CB)

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

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

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

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

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

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

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

print(res)

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

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

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

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

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

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

Solution (Python):

import sys
input = sys.stdin.readline









N = int(input())

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

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

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

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

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

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

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

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

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

Solution (Python):


import sys






























def main():
    mod = 1000000007                
    inf = float('inf')              
    
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    n = ii()
    print(800 * n - 200 * (n // 15))


if __name__ == "__main__":
    main()

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

n = I()

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

if __name__ == '__main__':
    main()

Solution (Python):

import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

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

if __name__ == '__main__':
    main()

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

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

ans = x-y        
print(ans)

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

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

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

pay = 800 * n
get = (n // 15) * 200

ans = pay - get

print(ans)

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

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

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

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

B = 0
for i in range(1,N+1):
    if i % 15 == 0:
        B += 1
L = 800 * N
C = B * 200
print(L - C)

Solution (Python):

"""
Created on Thu May 14 16:57:57 2020

@author: shinba
"""

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

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

Solution (Python):
import sys
import math
import bisect

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

if __name__ == "__main__":
    main()

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

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

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

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


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

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

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

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

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

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

Solution (Python):
import sys










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

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



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

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

Solution (Python):
def discount(x):
  return (x // 15) * 200

def cost(x):
  return x * 800

N = int(input())
Sum = cost(N) - discount(N)

print(Sum)

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, log2
from itertools import accumulate, permutations, combinations, product, groupby
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 - (N//15)*200)

Solution (Python):

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

    odai = N * 800
    odai -= int(N/15)*200

    print(odai)


if __name__ == '__main__':

    ABC_55_A()

Solution (Python):
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
MOD = 10**9 + 7

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

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

if __name__ == '__main__':
    main()

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

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

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

if n<15:
  print(n*800)
else:
  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())
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 collections
import itertools as it
import math

 

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

print(x-y)

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

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

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

print(x-y)

Solution (Python):
import math

n = int(input())

a = math.floor(n / 15)

print(800 * n - 200 * a)

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

print(a - b)

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

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

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

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

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

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

a = n // 15

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

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

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

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

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

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

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

Solution (Python):

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


if '__main__' == __name__:
    resolve()

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

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
inf = 10**17
mod = 10**9 + 7

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

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

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

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

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

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

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


if __name__ == '__main__':
    main()

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

Solution (Python):
N = int(input())
div, mod = divmod(N, 15)
x = N * 800
y = div * 200

print(x - y)

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

Solution (Python):
import numpy as np
import sys

input = sys.stdin.readline

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

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

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

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




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


if __name__ == '__main__':
    main()

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

if __name__ == '__main__':
    solve()

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

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

Solution (Python):

import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate


def read_ints():
    return list(map(int, read().split()))


def read_a_int():
    return int(read())


def read_tuple(H):
    '''
    H is number of rows
    '''
    ret = []
    for _ in range(H):
        ret.append(tuple(map(int, read().split())))
    return ret


def read_col(H):
    '''
    H is number of rows
    A列、B列が与えられるようなとき
    ex1)A,B=read_col(H)    ex2) A,=read_col(H) 
    '''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return tuple(map(list, zip(*ret)))


def read_matrix(H):
    '''
    H is number of rows
    '''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return ret
    


MOD = 10**9 + 7
INF = 2**31  

from collections import defaultdict, Counter, deque
from operator import itemgetter
from itertools import product, permutations, combinations
from bisect import bisect_left, bisect_right  



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

Solution (Python):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from heapq import heapify, heappop, heappush
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
 
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

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

sum = n * 800
minus = (n//15) * 200

print(sum-minus)

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

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

if __name__ == "__main__":
  resolve()

Solution (Python):
import math
N=int(input())
x=800*N
y=N//15
if (y+1)*15<=N:
  y+=1
print(x-200*y)

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

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

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

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

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