#include <iostream>
#define N 100001
using namespace std;

int d[N]={0};

int main(){
 int n,i,m;
 cin >> n;
 for(i=1;i<=n;i++){
   d[i]=d[i-1]+1;
   m=6;
   while(i>=m)
   {
       if(d[i]>d[i-m]){d[i]=d[i-m]+1;}
       m=m*6;
   }
   m=9;
   while(i>=m)
   {
       if(d[i]>d[i-m]){d[i]=d[i-m]+1;}
       m=m*9;
   }
 } 
 cout << d[n] << endl;
 return 0;
}
### Prompt

Develop a solution in Cpp 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>
#define N 100001
using namespace std;

int d[N]={0};

int main(){
 int n,i,m;
 cin >> n;
 for(i=1;i<=n;i++){
   d[i]=d[i-1]+1;
   m=6;
   while(i>=m)
   {
       if(d[i]>d[i-m]){d[i]=d[i-m]+1;}
       m=m*6;
   }
   m=9;
   while(i>=m)
   {
       if(d[i]>d[i-m]){d[i]=d[i-m]+1;}
       m=m*9;
   }
 } 
 cout << d[n] << endl;
 return 0;
}
```