#include<iostream>

using namespace std;

int main()
{ int N; cin >> N;
 int min_sum = N;
 for(int i = 0; i <= N; i++)
 {int m = N - i;
  int t = i;
  int a = 0;
  while(t > 0){ a += t % 6; t /= 6;}
  while(m > 0){ a += m % 9; m /= 9;}//進数表示の桁和計算
  
 if(a < min_sum)
 {min_sum = a ;}}
 
 cout << min_sum << endl;
 return 0;
}

### Prompt

In cpp, your task is to solve 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<iostream>

using namespace std;

int main()
{ int N; cin >> N;
 int min_sum = N;
 for(int i = 0; i <= N; i++)
 {int m = N - i;
  int t = i;
  int a = 0;
  while(t > 0){ a += t % 6; t /= 6;}
  while(m > 0){ a += m % 9; m /= 9;}//進数表示の桁和計算
  
 if(a < min_sum)
 {min_sum = a ;}}
 
 cout << min_sum << endl;
 return 0;
}

```