#include <bits/stdc++.h>
using namespace std;

int main(void) {
	int n, cnt = 0, remain;
	cin >> n;
	// the number of 25 cents
	cnt += n / 25;
	remain = n % 25;
	// the number of 10 cents
	cnt += remain / 10;
	remain = remain % 10;
	// the number of 5 cents
	cnt += remain / 5;
	// the number of 1 cents
	cnt += remain % 5;
	cout << cnt << endl;
}

### 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 <bits/stdc++.h>
using namespace std;

int main(void) {
	int n, cnt = 0, remain;
	cin >> n;
	// the number of 25 cents
	cnt += n / 25;
	remain = n % 25;
	// the number of 10 cents
	cnt += remain / 10;
	remain = remain % 10;
	// the number of 5 cents
	cnt += remain / 5;
	// the number of 1 cents
	cnt += remain % 5;
	cout << cnt << endl;
}

```