#include <iostream>
#include <vector>

using namespace std;

int main(){
	int t;
	cin >> t;
	vector<int> x{0, 1, 2, 3, 4, 1, 2, 3, 4, 5, 1, 2, 3, 4, 5, 2, 3, 4, 5, 6, 2, 3, 4, 5, 6};
	cout << (t / 25 + x[t % 25]) << endl;
	cin >> t;
	return 0;
}

### Prompt

Construct a CPP code solution to the problem outlined:

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 <vector>

using namespace std;

int main(){
	int t;
	cin >> t;
	vector<int> x{0, 1, 2, 3, 4, 1, 2, 3, 4, 5, 1, 2, 3, 4, 5, 2, 3, 4, 5, 6, 2, 3, 4, 5, 6};
	cout << (t / 25 + x[t % 25]) << endl;
	cin >> t;
	return 0;
}

```