#include<iomanip>
#include<limits>
#include<thread>
#include<utility>
#include<iostream>
#include<string>
#include<algorithm>
#include<set>
#include<map>
#include<vector>
#include<stack>
#include<queue>
#include<cmath>
#include<numeric>
#include<cassert>
#include<random>
#include<chrono>
#include<unordered_map>
#include<fstream>
#include<list>
#include<functional>
#include<bitset>
#include<complex>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pi;
typedef pair<double,double> pd;
typedef pair<double,ll> pdl;
#define F first
#define S second
const ll E=1e18+7;
const ll MOD=1000000007;




int main(){
    ll n;
    cin>>n;
    vector<ll> dp(200,E);
    dp[0]=0;
    for(int i=0;i<100;i++){
        dp[i+1]=min(dp[i+1],dp[i]+1);
        dp[i+5]=min(dp[i+5],dp[i]+1);
        dp[i+10]=min(dp[i+10],dp[i]+1);
        dp[i+25]=min(dp[i+25],dp[i]+1);
    }
    ll ans=n/100*4;
    n%=100;
    ans+=dp[n];
    cout<<ans<<endl;
    
    
    
    
    return 0;
}


### Prompt

Develop a solution in Cpp 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<iomanip>
#include<limits>
#include<thread>
#include<utility>
#include<iostream>
#include<string>
#include<algorithm>
#include<set>
#include<map>
#include<vector>
#include<stack>
#include<queue>
#include<cmath>
#include<numeric>
#include<cassert>
#include<random>
#include<chrono>
#include<unordered_map>
#include<fstream>
#include<list>
#include<functional>
#include<bitset>
#include<complex>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pi;
typedef pair<double,double> pd;
typedef pair<double,ll> pdl;
#define F first
#define S second
const ll E=1e18+7;
const ll MOD=1000000007;




int main(){
    ll n;
    cin>>n;
    vector<ll> dp(200,E);
    dp[0]=0;
    for(int i=0;i<100;i++){
        dp[i+1]=min(dp[i+1],dp[i]+1);
        dp[i+5]=min(dp[i+5],dp[i]+1);
        dp[i+10]=min(dp[i+10],dp[i]+1);
        dp[i+25]=min(dp[i+25],dp[i]+1);
    }
    ll ans=n/100*4;
    n%=100;
    ans+=dp[n];
    cout<<ans<<endl;
    
    
    
    
    return 0;
}


```