Dollars
-------
Canadian currency consists of $100, $50, $20, $10, and $5 notes and 
$2, $1, 25c, 10c, 5c and 1c coins.  Write a program that will determine, 
for any given amount, in how many ways that amount may be made up. 
Changing the order of listing does not increase the count.  Thus 14c 
may be made up in 4 ways: 1 x 10c + 4 x 1c, 2 x 5c + 4 x 1c, 
1 x 5c + 9 x 1c and 14 x 1c.

Input
-----
Input will consist of a series of positive numbers no greater than 30000,
each on a separate line.  These numbers represent an amount in the number 
of cents.  For example, 120 represents one dollar and twenty cents.
The input will be terminated by a line containing zero.

Output
------
Output will consist of a line for each of the amounts in the input.
Each line consists of the number of ways in which that amount may be 
made up.

Sample input
------------
20
200
0

Sample output
-------------
9
1707