#include<bits/stdc++.h>

using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)

typedef long long ll;
typedef pair<int, int> P;

#define MAX 100005
#define INF 1001001001

int main(int, char**)
{
  vector<int> coin = { 25, 10, 5, 1 };
  int ans = 0;

  int n; cin >> n;

  rep(i,coin.size()) {
    ans += n / coin[i];
    n %= coin[i];
  }
  cout << ans << 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;
#define rep(i,n) for(int i=0;i<(n);i++)

typedef long long ll;
typedef pair<int, int> P;

#define MAX 100005
#define INF 1001001001

int main(int, char**)
{
  vector<int> coin = { 25, 10, 5, 1 };
  int ans = 0;

  int n; cin >> n;

  rep(i,coin.size()) {
    ans += n / coin[i];
    n %= coin[i];
  }
  cout << ans << endl;

  return 0;
}


```