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



int main(){
  ll n;
  cin >> n;
  ll ans=n/25;
  n=n%25;
  if(n!=0)ans+=n/10;
  n=n%10;
  if(n!=0)ans+=n/5;
  n=n%5;
  ans+=n;
  cout << ans << endl;
  return 0;
}


### Prompt

Please provide a Cpp coded solution 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<bits/stdc++.h>
using namespace std;
using ll=long long;



int main(){
  ll n;
  cin >> n;
  ll ans=n/25;
  n=n%25;
  if(n!=0)ans+=n/10;
  n=n%10;
  if(n!=0)ans+=n/5;
  n=n%5;
  ans+=n;
  cout << ans << endl;
  return 0;
}


```