Description

Xiao Ming has n yuan to spend entirely on books. The books are priced at 10 yuan, 20 yuan, 50 yuan, and 100 yuan each. How many different ways can Xiao Ming spend all his money on these books? (Multiple copies of each book can be purchased.)

Input Format

An integer n, representing the total amount of money (0 ≤ n ≤ 1000).

Output Format

An integer representing the number of possible purchasing schemes.

20

2

15

0

0

1