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

int main() {
  int n; cin >> n;

  vector<int> c = {25, 10, 5, 1};
  int ans = 0;
  for (int i = 0; i < 4; i ++) {
    int a = n / c[i];
    int b = n % c[i];
    ans += a;
    n -= a * c[i];
  }

  cout << ans << endl;
}


### 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;
typedef long long LL;

int main() {
  int n; cin >> n;

  vector<int> c = {25, 10, 5, 1};
  int ans = 0;
  for (int i = 0; i < 4; i ++) {
    int a = n / c[i];
    int b = n % c[i];
    ans += a;
    n -= a * c[i];
  }

  cout << ans << endl;
}


```