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

-----Sample Output-----
15800

So far, Snuke has paid 16000 yen, and the restaurant has paid back 200 yen. Thus, the answer is 15800.

Source: atcoder | Difficulty: EASY


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


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


n = int(input())
x = 800 * n
y = 0
if n >= 15:
	y = 200 * (n // 15)
ans = x - y
print(ans)


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


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


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


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


import math
N = int(input())
x = 800 * N
y = math.floor(N / 15) * 200
print(x - y)


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


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


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


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


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


input_num = int(input())
X = input_num * 800
Y = int(input_num / 15) * 200
result = X - Y
print(result)


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


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


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


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)


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)


import sys, math
from itertools import combinations as c, product as p
from collections import deque
sys.setrecursionlimit(10 ** 9)

def si():
	return input()

def ii():
	return int(input())

def fi():
	return float(input())

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

def lint():
	return list(map(int, input().split()))

def lint_dec():
	return list([int(x) - 1 for x in input().split()])

def lnstr(n):
	return [input() for _ in range(n)]

def lnint(n):
	return [int(input()) for _ in range(n)]

def lint_list(n):
	return [lint() for _ in range(n)]
N = ii()
print(800 * N - 200 * (N // 15))


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

def __starting_point():
	main()
__starting_point()


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


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


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)