#include<iostream>
using namespace std;

int main(void){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    
    int table[4] = {25,10,5,1},index = 0,num = 0;
    unsigned long input;
    cin >> input;
    
    while(1){
        if(input >= table[index]){
            int tmp = input / table[index];
            num += tmp;
            input -= tmp * table[index];
            if(input <= 0){
                break;
            }
        }
        ++index;
    }
    cout << num << 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<iostream>
using namespace std;

int main(void){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    
    int table[4] = {25,10,5,1},index = 0,num = 0;
    unsigned long input;
    cin >> input;
    
    while(1){
        if(input >= table[index]){
            int tmp = input / table[index];
            num += tmp;
            input -= tmp * table[index];
            if(input <= 0){
                break;
            }
        }
        ++index;
    }
    cout << num << endl;
}

```