#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,s,n) for(int i=s;i<n;i++)
#define all(a) a.begin(),a.end()
typedef long long ll;
const ll inf = 1e9;

int main(){
    int n; cin >> n;
    int m = 0;
    int p[] = {25, 10, 5, 1};
    rep(i,4){
        m += n / p[i];
        n %= p[i]; 
    }
    cout << m << endl;
    return 0;
}

### Prompt

Please create a solution in Cpp 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>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,s,n) for(int i=s;i<n;i++)
#define all(a) a.begin(),a.end()
typedef long long ll;
const ll inf = 1e9;

int main(){
    int n; cin >> n;
    int m = 0;
    int p[] = {25, 10, 5, 1};
    rep(i,4){
        m += n / p[i];
        n %= p[i]; 
    }
    cout << m << endl;
    return 0;
}

```