#include<bits/stdc++.h>
using namespace std;
int n,cnt;
int V[100010],F[100010];
int main() {
	scanf("%d",&n);
	V[++cnt]=1;
	for(int i=6;i<=n;i*=6) V[++cnt]=i;
	for(int i=9;i<=n;i*=9) V[++cnt]=i;
	memset(F,127,sizeof(F));
	F[0]=0;
	for(int i=1;i<=cnt;i++)
		for(int j=V[i];j<=n;j++)
			F[j]=min(F[j-V[i]]+1,F[j]);
	printf("%d\n",F[n]);
	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,cnt;
int V[100010],F[100010];
int main() {
	scanf("%d",&n);
	V[++cnt]=1;
	for(int i=6;i<=n;i*=6) V[++cnt]=i;
	for(int i=9;i<=n;i*=9) V[++cnt]=i;
	memset(F,127,sizeof(F));
	F[0]=0;
	for(int i=1;i<=cnt;i++)
		for(int j=V[i];j<=n;j++)
			F[j]=min(F[j-V[i]]+1,F[j]);
	printf("%d\n",F[n]);
	return 0;
}
```