
#include<bits/stdc++.h>

using namespace std;
#define lp(i,n) for(int i=0;i<n;i++)
#define lps(i,j,n) for(int i=j;i<n;i++)
#define fordebug int hoge;cin>>hoge;
#define DEKAI 1000000007;
#define INF (1<<28)
#define int long long


signed main(){
  int n;
  cin>>n;
  int ans=0;
  int a[4]={25,10,5,1};
  lp(i,4){
    ans+=n/a[i];
    n%=a[i];
  }
  cout<<ans<<endl;
  return 0;
}


### Prompt

Please create a solution in Cpp 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 lp(i,n) for(int i=0;i<n;i++)
#define lps(i,j,n) for(int i=j;i<n;i++)
#define fordebug int hoge;cin>>hoge;
#define DEKAI 1000000007;
#define INF (1<<28)
#define int long long


signed main(){
  int n;
  cin>>n;
  int ans=0;
  int a[4]={25,10,5,1};
  lp(i,4){
    ans+=n/a[i];
    n%=a[i];
  }
  cout<<ans<<endl;
  return 0;
}


```