#include <stdio.h>

int main(){
	int n, ans = 0;
	scanf ("%d", &n);
	while (n>0){
		if (n>=25) n-=25;
		else if (n>=10) n-=10;
		else if (n>=5) n-=5;
		else n--;
		ans++;
	}
	printf ("%d\n", ans);
	return 0;
}

### Prompt

Please formulate a CPP solution 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 <stdio.h>

int main(){
	int n, ans = 0;
	scanf ("%d", &n);
	while (n>0){
		if (n>=25) n-=25;
		else if (n>=10) n-=10;
		else if (n>=5) n-=5;
		else n--;
		ans++;
	}
	printf ("%d\n", ans);
	return 0;
}

```