#include <iostream>
using namespace std;
int main(void){
    int n;
    cin>>n;
    int s=0;
    while(true){
        if(n<25)    break;
        else{
            n=n-25;
            s=s+1;
        }
    }
    while(true){
        if(n<10)    break;
        else{
            n=n-10;
            s=s+1;
        }
    }
    while(true){
        if(n<5)    break;
        else{
            n=n-5;
            s=s+1;
        }  
    }
    s=s+n;
    cout<<s;
    cout<<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>
using namespace std;
int main(void){
    int n;
    cin>>n;
    int s=0;
    while(true){
        if(n<25)    break;
        else{
            n=n-25;
            s=s+1;
        }
    }
    while(true){
        if(n<10)    break;
        else{
            n=n-10;
            s=s+1;
        }
    }
    while(true){
        if(n<5)    break;
        else{
            n=n-5;
            s=s+1;
        }  
    }
    s=s+n;
    cout<<s;
    cout<<endl;
}
    


```