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
#include <iostream>
using namespace std;

int main() {
    int n;
    cin >> n;

    int r = n;
    const int c25 = r / 25;
    r -= 25 * c25;
    const int c10 = r / 10;
    r -= 10 * c10;
    const int c5 = r / 5;
    r -= 5 * c5;

    cout << c25 + c10 + c5 + r << endl;
}
