#include <bits/stdc++.h>
using namespace std;
const int maxn = 123456;
int f[maxn];
int main(){
  iota(f, f + maxn, 0);
  for(int p : {6, 9}){
  	long long now = p;
   	while(now < maxn){
		for(int i = 0; i < maxn - now; i++) f[i + now] = min(f[i + now], f[i] + 1);
      now *= p;
    }
  }
  int n; cin >> n;
  cout << f[n] << endl;
  return 0;
}
### Prompt

Construct a CPP code solution to the problem outlined:

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 <bits/stdc++.h>
using namespace std;
const int maxn = 123456;
int f[maxn];
int main(){
  iota(f, f + maxn, 0);
  for(int p : {6, 9}){
  	long long now = p;
   	while(now < maxn){
		for(int i = 0; i < maxn - now; i++) f[i + now] = min(f[i + now], f[i] + 1);
      now *= p;
    }
  }
  int n; cin >> n;
  cout << f[n] << endl;
  return 0;
}
```