#include <stdio.h>
#include <algorithm>

int main(){
	long long int n = 0;
	scanf("%lld",&n);
	long long int temp = 0;
	while(n!=0){
		if(n>=25){
			temp += (n/25);
			n = n % 25;
			continue;
		}else if(n<25 && n>=10){
			temp += (n/10);
			n = n % 10;
		}else if(n<10 && n>=5){
			temp += (n/5);
			n = n % 5;
		}else if(n<5){
			temp += (n/1);
			n = n % 1;
		}
	}
	printf("%lld\n",temp);
	
	return 0;
}

### Prompt

Your challenge is to write 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>
#include <algorithm>

int main(){
	long long int n = 0;
	scanf("%lld",&n);
	long long int temp = 0;
	while(n!=0){
		if(n>=25){
			temp += (n/25);
			n = n % 25;
			continue;
		}else if(n<25 && n>=10){
			temp += (n/10);
			n = n % 10;
		}else if(n<10 && n>=5){
			temp += (n/5);
			n = n % 5;
		}else if(n<5){
			temp += (n/1);
			n = n % 1;
		}
	}
	printf("%lld\n",temp);
	
	return 0;
}

```