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

int main()
{
  int n;
  cin >> n;
  int a,b,c,d;

  a = n/25;
  b = n%25/10;
  c = (n-a*25-b*10)/5;
  d = n%5;
  
  cout << a+b+c+d << endl;
  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<bits/stdc++.h>
using namespace std;

int main()
{
  int n;
  cin >> n;
  int a,b,c,d;

  a = n/25;
  b = n%25/10;
  c = (n-a*25-b*10)/5;
  d = n%5;
  
  cout << a+b+c+d << endl;
  return 0;
}

```