#include <iostream>
#include <algorithm>
#include <iterator>
#include <iomanip>
#include <cmath>
#include <vector>
#include <numeric>
#include <cstdio>
#include <bitset>
#include <map>
#include <string>
#include <valarray>
#include <queue>
#include <utility>

using namespace std;

int main()
{
    int n;
    cin >> n;
    int factor[] = {25, 10, 5, 1};

    int i = 0, sum = 0;
    while (i < 4)
    {
        sum += n / factor[i];
        n = n % factor[i];
        i++;
    }

    cout << sum << endl;
}

### 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 <iostream>
#include <algorithm>
#include <iterator>
#include <iomanip>
#include <cmath>
#include <vector>
#include <numeric>
#include <cstdio>
#include <bitset>
#include <map>
#include <string>
#include <valarray>
#include <queue>
#include <utility>

using namespace std;

int main()
{
    int n;
    cin >> n;
    int factor[] = {25, 10, 5, 1};

    int i = 0, sum = 0;
    while (i < 4)
    {
        sum += n / factor[i];
        n = n % factor[i];
        i++;
    }

    cout << sum << endl;
}

```