#include <iostream>
#include <stdio.h>

typedef unsigned long long ull;
using namespace std;

int main(int argc, char *argv[])
{
    int n;
    scanf("%d", &n);
    ull res = 0;
    while (n != 0)
    {
        if (n - 25 >= 0)
        {
            n = n - 25;
        }
        else if (n - 10 >= 0)
        {
            n = n - 10;
        }
        else if (n - 5 >= 0)
        {
            n = n - 5;
        }
        else
        {
            n = n - 1;
        }
        res++;
    }
    printf("%lld\n", res);
    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>
#include <stdio.h>

typedef unsigned long long ull;
using namespace std;

int main(int argc, char *argv[])
{
    int n;
    scanf("%d", &n);
    ull res = 0;
    while (n != 0)
    {
        if (n - 25 >= 0)
        {
            n = n - 25;
        }
        else if (n - 10 >= 0)
        {
            n = n - 10;
        }
        else if (n - 5 >= 0)
        {
            n = n - 5;
        }
        else
        {
            n = n - 1;
        }
        res++;
    }
    printf("%lld\n", res);
    return 0;
}


```