#include <iostream>
using namespace std;

int main() {
    int coins[4] = {25, 10, 5, 1};
    long n, a, x;
    cin >> n;
    x = 0;
    for (int i = 0; i < 4; i++) {
        x += n / coins[i];
        n = n % coins[i];
    }
    cout << x << 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 <iostream>
using namespace std;

int main() {
    int coins[4] = {25, 10, 5, 1};
    long n, a, x;
    cin >> n;
    x = 0;
    for (int i = 0; i < 4; i++) {
        x += n / coins[i];
        n = n % coins[i];
    }
    cout << x << endl;

    return 0;
}


```