Problem Background

gza goes to the supermarket, which is having a crazy sale!

Problem Description

The supermarket offers two coupons:

• The first coupon: Reduce $20 if the total is at least $100.
• The second coupon: Reduce $50 if the total is at least $200.

gza can use the coupons in any order. The coupon used first will affect the eligibility for the next coupon. For example, if gza buys $210 worth of goods and uses the first coupon first, the price becomes $190, at which point the second coupon cannot be used.

Given the initial amount $n$ that needs to be paid, find the minimum amount gza needs to pay in the end.

Input Format

A single line containing an integer $n$, representing the total price of the goods that need to be paid.

Output Format

A single line containing an integer, representing the answer.

Sample Input and Output

Sample Input #1

370

Sample Output #1

300

Sample Input #2

120

Sample Output #2

100

Notes

Data Range and Constraints

For $100\%$ of the data, $1 \leq n \leq 1000$.

见题面 Input 部分

见题面 Output 部分