#include <iostream>
#include <vector>

using namespace std;
typedef long long ll;
ll s[4]={25, 10, 5, 1};

int main(){
    ll n; cin>>n;
    int ans = 0;
    for(int i=0;i<4;i++){
        ans += n/s[i];
        n %= s[i];
        if(n==0) break;
    }
    cout<<ans<<endl;
}

### Prompt

Construct a CPP code solution to the problem outlined:

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>
#include <vector>

using namespace std;
typedef long long ll;
ll s[4]={25, 10, 5, 1};

int main(){
    ll n; cin>>n;
    int ans = 0;
    for(int i=0;i<4;i++){
        ans += n/s[i];
        n %= s[i];
        if(n==0) break;
    }
    cout<<ans<<endl;
}

```