#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using lint = long int;
using llint = long long int;
using namespace std;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int n;
    cin >> n;

    int coin = 0;
    coin += n / 25;
    n %= 25;

    coin += n / 10;
    n %= 10;

    coin += n / 5;
    n %= 5;
    coin += n;

    cout << coin << endl;
    return 0;
}

### Prompt

Your challenge is to write 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>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using lint = long int;
using llint = long long int;
using namespace std;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int n;
    cin >> n;

    int coin = 0;
    coin += n / 25;
    n %= 25;

    coin += n / 10;
    n %= 10;

    coin += n / 5;
    n %= 5;
    coin += n;

    cout << coin << endl;
    return 0;
}

```