#include<bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
int main() {
    int n; cin >> n;
    int c = 0;
    while (1) {if (n - 25 >= 0) {n -= 25; c++;} else break;}
    while (1) {if (n - 10 >= 0) {n -= 10; c++;} else break;}
    while (1) {if (n - 5 >= 0) {n -= 5; c++;} else break;}
    while (1) {if (n - 1 >= 0) {n -= 1; c++;} else break;}
    cout << c << 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>
using namespace std;
const int inf = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
int main() {
    int n; cin >> n;
    int c = 0;
    while (1) {if (n - 25 >= 0) {n -= 25; c++;} else break;}
    while (1) {if (n - 10 >= 0) {n -= 10; c++;} else break;}
    while (1) {if (n - 5 >= 0) {n -= 5; c++;} else break;}
    while (1) {if (n - 1 >= 0) {n -= 1; c++;} else break;}
    cout << c << endl;
}


```