A. Hit the Lottery（贪心）

A. Hit the Lottery

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Allen has a LOT of money. He has $n$ dollars in the bank. For security reasons, he wants to withdraw it in cash (we will not disclose the reasons here). The denominations for dollar bills are $1$, $5$, $10$, $20$, $100$. What is the minimum number of bills Allen could receive after withdrawing his entire balance?

Input

The first and only line of input contains a single integer $n$ ($1\le n\le {10}^9$).

Output

Output the minimum number of bills that Allen could receive.

Examples

input

Copy

125

output

Copy

3

input

Copy

43

output

Copy

5

input

Copy

1000000000

output

Copy

10000000

Note

In the first sample case, Allen can withdraw this with a $100$ dollar bill, a $20$ dollar bill, and a $5$ dollar bill. There is no way for Allen to receive $125$ dollars in one or two bills.

In the second sample case, Allen can withdraw two $20$ dollar bills and three $1$ dollar bills.

In the third sample case, Allen can withdraw $100000000$ (ten million!) $100$

 dollar bills

题意：你有n元钱，现在有1,5,10,20,100的纸币。问将n元钱全部换成纸币，你最少可以获得几张纸币。

思路；贪心，先换最大的纸币，依次换下去即可。

#include "iostream"
using namespace std;
int main()
{
    int n,ans=0;
    cin>>n;
    if(n>=100) ans+=n/100,n-=100*(n/100);
    if(n>=20) ans+=n/20,n-=20*(n/20);
    if(n>=10) ans+=n/10,n-=10*(n/10);
    if(n>=5) ans+=n/5,n-=5*(n/5);
    if(n>=1) ans+=n/1,n-=n/1;
    cout<<ans<<endl;
    return 0;
}