#include <iostream>
using namespace std;


int main(void){
    int N,i; cin>>N;
    int dp[100010];
    dp[0]=0;
    
    for(i=1;i<=N;i++){
        int c=1;
        while(c<=i){
            dp[i]=1+dp[i-c];
            c*=6;
        }
        c=9;
        while(c<=i){
            dp[i]=min(dp[i],1+dp[i-c]);
            c*=9;
       }
    }
    cout<<dp[N];
}
### Prompt

Please provide a cpp coded solution to the problem described below:

To make it difficult to withdraw money, a certain bank allows its customers to withdraw only one of the following amounts in one operation:

* 1 yen (the currency of Japan)

* 6 yen, 6^2(=36) yen, 6^3(=216) yen, ...

* 9 yen, 9^2(=81) yen, 9^3(=729) yen, ...




At least how many operations are required to withdraw exactly N yen in total?

It is not allowed to re-deposit the money you withdrew.

Constraints

* 1 \leq N \leq 100000
* N is an integer.

Input

Input is given from Standard Input in the following format:


N


Output

If at least x operations are required to withdraw exactly N yen in total, print x.

Examples

Input

127


Output

4


Input

3


Output

3


Input

44852


Output

16

### Response

```cpp
#include <iostream>
using namespace std;


int main(void){
    int N,i; cin>>N;
    int dp[100010];
    dp[0]=0;
    
    for(i=1;i<=N;i++){
        int c=1;
        while(c<=i){
            dp[i]=1+dp[i-c];
            c*=6;
        }
        c=9;
        while(c<=i){
            dp[i]=min(dp[i],1+dp[i-c]);
            c*=9;
       }
    }
    cout<<dp[N];
}
```