#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 99999999999999999
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;

int N;
int coin[4] = {25,10,5,1};

int main(){

	scanf("%d",&N);

	int ans = 0;

	for(int i = 0; i < 4; i++){

		ans += N/coin[i];
		N %= coin[i];
	}

	printf("%d\n",ans);

	return 0;
}


### Prompt

Create a solution in Cpp for 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>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 99999999999999999
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;

int N;
int coin[4] = {25,10,5,1};

int main(){

	scanf("%d",&N);

	int ans = 0;

	for(int i = 0; i < 4; i++){

		ans += N/coin[i];
		N %= coin[i];
	}

	printf("%d\n",ans);

	return 0;
}


```