#include <cstdio> 
int N; 
int main() { 
  scanf("%d",&N); 
  int res=N; for(int i=0;i<=N;i++) { int cc=0; int t=i; while(t>0)cc+=t%6,t/=6; t=N-i; while(t>0)cc+=t%9,t/=9; if(res>cc)res=cc; } printf("%d\n",res); }

### Prompt

Please create a solution in CPP to the following problem:

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 <cstdio> 
int N; 
int main() { 
  scanf("%d",&N); 
  int res=N; for(int i=0;i<=N;i++) { int cc=0; int t=i; while(t>0)cc+=t%6,t/=6; t=N-i; while(t>0)cc+=t%9,t/=9; if(res>cc)res=cc; } printf("%d\n",res); }

```