#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main()
{
    ll n;
    cin>>n;
    ll cnt=0;
    while(n>=25){
        n-=25;
        cnt++;
    }
    while(n>=10){
        n-=10;
        cnt++;
    }
    while(n>=5){
        n-=5;
        cnt++;
    }
    while(n>=1){
        n-=1;
        cnt++;
    }
    cout<<cnt<<endl;
}

### Prompt

Please formulate a Cpp solution to 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 <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main()
{
    ll n;
    cin>>n;
    ll cnt=0;
    while(n>=25){
        n-=25;
        cnt++;
    }
    while(n>=10){
        n-=10;
        cnt++;
    }
    while(n>=5){
        n-=5;
        cnt++;
    }
    while(n>=1){
        n-=1;
        cnt++;
    }
    cout<<cnt<<endl;
}

```