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

#define INF (int)(1e9)
#define MOD (int)((int)1e9+7)

int main(){
  int n, m = 0;

  cin>>n;

  m += n/25;
  n -= 25*(n/25);
  
  m += n/10;
  n -= 10*(n/10);
  
  m += n/5;
  n -= 5*(n/5);
  
  m += n;
  cout<<m<<endl;
  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>
using namespace std;

#define INF (int)(1e9)
#define MOD (int)((int)1e9+7)

int main(){
  int n, m = 0;

  cin>>n;

  m += n/25;
  n -= 25*(n/25);
  
  m += n/10;
  n -= 10*(n/10);
  
  m += n/5;
  n -= 5*(n/5);
  
  m += n;
  cout<<m<<endl;
  return 0;
}

```