n=int(input())
if n<=10:
m=5*n
if n>10:
m=(50+4*(n-10))
print(m)

求一行算法
x=int(input())
print(5*x-(max(0,x-10)))

n=int(input())
if n<=10:
print(n*5)
else:
print(50+(n-10)*4)

a=int(input())
b=5*a
c=a*4+10
if a<=10:
print(b)
else:
print(c)

import math
n=int(input())
if n<=10:
print(n*5)
else:
print(50+(n-10)*4)

x=int(input())
if(x<=10):
m=x*5
else:
m=50+(x-10)*4
print(m)

x=int(input())
if(x<=10):
m=x*5
else:
m=50+(x-10)*4
print(m)

#include <iostream>
#include <math.h>
#include <iomanip>

using namespace std;

int main()
{
int n, price;
cin >> n;
if(n <= 10)
{
price = n * 5;
}
else
{
price = 50 + (n - 10) * 4;
}
cout << price;
return 0;
}

n=int(input())
if n<=10:
m=5*n
if n>10:
m=(50+4*(n-10))
print(m)

x=int(input())
if(x<=10):
m=x*5
else:
m=50+(x-10)*4
print(m)

n=int(input())
if n<10:
p=n*5
else:
n>=10
p=50+(n-10)*4
print(p)

n=int(input())
if(n<=10):
x=n*5
else:
x=50+(n-10)*4
print(x)

n=int(input(),10)
a=5*n
if n>10:
a=(4*n+10)
print(a)

import math
n=int(input())
if n<=10:
p=5*n
elif n>10:
s=n-10
p=50+4*s

print(p)

n=int(input())
if(n>10):
print(50+4*(n-10))
else:
print(5*n)

import math
x=int(input())
if():
print()
elif():
print()

-*- coding: utf-8 -*-

a=int(input())
if(a<=10):
print(a*5)
else:
print