#include<bits/stdc++.h>
using namespace std;
int n,opt[100005];
int c[20] = {1,6,36,216,1296,7776,46656,9,81,729,6561,59049};
int main(){
	cin >> n;
	for(int i = 1;i <= n;i++){
		opt[i] = i;
		for(int j = 0;j < 12;j++)
			if (i >= c[j]) opt[i] = min(opt[i],opt[i - c[j]] + 1);		
	}
	cout << opt[n] << endl;
	return 0;		
}
### Prompt

Please formulate a CPP solution 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<bits/stdc++.h>
using namespace std;
int n,opt[100005];
int c[20] = {1,6,36,216,1296,7776,46656,9,81,729,6561,59049};
int main(){
	cin >> n;
	for(int i = 1;i <= n;i++){
		opt[i] = i;
		for(int j = 0;j < 12;j++)
			if (i >= c[j]) opt[i] = min(opt[i],opt[i - c[j]] + 1);		
	}
	cout << opt[n] << endl;
	return 0;		
}
```