#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include <functional>
#include <iomanip>
using namespace std;

#define rep(p,q) for(int i = p;i < q;i++)

#define LL long long int

#define inf 10000000000

//15
int main(void) {
	LL n;
	cin >> n;
	int count = 0;
	count += n / 25;
	n %= 25;
	count += n / 10;
	n %= 10;
	count += n / 5;
	n %= 5;
	count += n;
	cout << count << endl;
}

### Prompt

Develop a solution in cpp to the problem described below:

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<string>
#include<vector>
#include<algorithm>
#include <functional>
#include <iomanip>
using namespace std;

#define rep(p,q) for(int i = p;i < q;i++)

#define LL long long int

#define inf 10000000000

//15
int main(void) {
	LL n;
	cin >> n;
	int count = 0;
	count += n / 25;
	n %= 25;
	count += n / 10;
	n %= 10;
	count += n / 5;
	n %= 5;
	count += n;
	cout << count << endl;
}

```