#include <iostream>
#include <algorithm>
using namespace std;

int m[4] = {25, 10, 5, 1};

int main() {
  int n;
  cin >> n;
  int num = 0;
  int i= 0;

  num += n/m[i];

  while((n %= m[i++]) != 0) {
    num += n/m[i];
  }

  cout << num << endl;
}


### 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 <iostream>
#include <algorithm>
using namespace std;

int m[4] = {25, 10, 5, 1};

int main() {
  int n;
  cin >> n;
  int num = 0;
  int i= 0;

  num += n/m[i];

  while((n %= m[i++]) != 0) {
    num += n/m[i];
  }

  cout << num << endl;
}


```