#include<iostream>
using namespace std;
typedef long long ll;
int main(){
    ll n;
    cin>>n;
    ll c25=n/25;
    ll c25u=n%25;
    ll c10=c25u/10;
    ll c10u=c25u%10;
    ll c5=c10u/5;
    ll c1=c10u%5;
    //cout<<c25<<" "<<c10<<" "<<c5<<c1<<endl;
    cout<<c25+c10+c5+c1<<endl;
    return 0;
}


### Prompt

Create a solution in CPP for the following problem:

You want to make change for $ n $ cents. Assuming that you have infinite supply of coins of 1, 5, 10 and / or 25 cents coins respectively, find the minimum number of coins you need.

Constraints

* $ 1 \ le n \ le 10 ^ 9 $

Input


$ n $


The integer $ n $ is given in a line.

output

Print the minimum number of coins you need in a line.

Examples

Input

100


Output

4


Input

54321


Output

2175

### Response

```cpp
#include<iostream>
using namespace std;
typedef long long ll;
int main(){
    ll n;
    cin>>n;
    ll c25=n/25;
    ll c25u=n%25;
    ll c10=c25u/10;
    ll c10u=c25u%10;
    ll c5=c10u/5;
    ll c1=c10u%5;
    //cout<<c25<<" "<<c10<<" "<<c5<<c1<<endl;
    cout<<c25+c10+c5+c1<<endl;
    return 0;
}


```