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.



Sample input:
20


Sample output:
15800

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
N = int(input())

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

print(x - y)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
N = int(input())
x = 800 * N
y = (N // 15) * 200
print(x - y)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

i = int(n/15)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print((800 * N) - y)

Submission status: Accepted

Solution code:
n = int(input())
#da = list(map(int,input().split()))
#a,b = map(int,input().split())

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

print(ans)

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#55a
N = int(input())
x = 800 * N
y = N//15 * 200
print(x- y)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
食べた回数=int(input())
値段=800
ボーナス=200
支払うお金=食べた回数*値段
もらうお金=食べた回数//15 * ボーナス
     
print(支払うお金-もらうお金)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
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)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int( input() )

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

print( x - y )

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

print(x - y)

Submission status: Accepted

Solution code:
N = int(input())

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

print(x - y)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

a = n // 15

print(n*800 - a*200)

Submission status: Accepted

Solution code:
from sys import stdin
import bisect

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

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

Submission status: Accepted

Solution code:
# ABC055a
import sys
import math
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

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

Submission status: Accepted

Solution code:
n=int(input())

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

print(x-y)

Submission status: Accepted

Solution code:
N = int(input())

def pay():
    fee = 800
    reward = 200

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
##### 解けた #####

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(ALL - TIMES)

Submission status: Accepted

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

Submission status: Accepted

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

print(sum - otsuri)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input());print(int(40/3*(n*59+n%15)))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import math

#入力
N = int(input())

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

print (x-y)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
# A - Restaurant
N = int(input())

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

print(ans-tmp)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(raw_input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
yen = 0

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

print(yen)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

print(s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#Restaurant
N = int(input())
Back = N // 15 * 200
Pay = N * 800 - Back
print(Pay)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

print(ans)

Submission status: Accepted

Solution code:
# A - Restaurant
n = int(input())
print(800 * n - n // 15 * 200)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
N = int(input())
x = 800*N
y = int(N/15)*200
print(x-y)

Submission status: Accepted

Solution code:
N=int(input())

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

Submission status: Accepted

Solution code:
f=lambda x:800*x-200*(x//15)
print(f(int(input())))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
number_of_kanshoku = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
pay = 800 * n
bonus = 200 * (n // 15)
print(pay - bonus)

Submission status: Accepted

Solution code:
n = int(input())
g = n // 15

print(800*n - 200*g)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#n = int(input())
#n,k = map(int,input().split())
#x = list(map(int,input().split()))

n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#price=800 yen 
n=int(input())
print(n*800-(n//15)*200)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

N = int(input())

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

Submission status: Accepted

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

N = int(input())

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

Submission status: Accepted

Solution code:
N = int(input())

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

print(pay-back)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

print(x - y)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
#2019/10/04
N = int(open(0).read())
print(N*800-(N//15)*200)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    slove()

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

price = 800
gain = 200

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    resolve()

Submission status: Accepted

Solution code:
#coding:utf-8

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

print(800 * n - 200 * back)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

print(x-y)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#A
N = int(input())
print(800*N - 200*(N//15))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#ABC055A
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

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

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# ABC055 A - Restaurant
n = int(input())
x = 800*n 
y = (n//15)*200
print(int(x-y))

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
N = int(input())

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

print(x-y)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
    
n=int(input())

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

Submission status: Accepted

Solution code:
n = int(input()) #number of meals
print(n*800 - n//15*200)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

import sys

input = sys.stdin.readline

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

main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

ans = X - Y 
print(ans)

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())

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

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    i = N // 15
    return N * 800 - i * 200 

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

print( ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

x = n * 800

y = (n // 15) * 200

print(int(x-y))

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
N=int(input())

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

print(x-y)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input().strip())
print(int(N*800-(N//15)*200))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

N = int(input())

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

Submission status: Accepted

Solution code:
N=int(input())

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**7)
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return sys.stdin.readline().strip()
INF = 10 ** 18
MOD = 10 ** 9 + 7

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


main()

Submission status: Accepted

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

Submission status: Accepted

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

resolve()

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

dc200 = n // 15

res = n * 800 - dc200 * 200

print(res)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(x-y)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

a = n//15

print(800*n - 200*a)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
INF = float("inf")


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


def main():

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    solve(N)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N = int(input())

gain = N // 15

print(N * 800 - gain * 200)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = int(input())

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

Submission status: Accepted

Solution code:
n = int(input())

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

print(int(price))

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
""" abc055_a """

import sys

H = pow(10, 9) + 7

def _main():
    _n = int(sys.stdin.readline())

    _x = 800 * _n
    _y = int(_n/15) * 200

    print(_x - _y)

if __name__ == '__main__':
    _main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
#55

N = int(input())

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

Submission status: Accepted

Solution code:

N = int(input())

A = N // 15

Ans = N * 800 - A * 200
print(Ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
a = n // 15

print(n*800 - a*200)

Submission status: Accepted

Solution code:
import math

n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-S
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

give = n * 800
take = n // 15 * 200

print(give - take)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

print(x - y)