#include<cstdio>
#include<cstring>
int f[100005];
int min(int x,int y) {return x<y?x:y;}
int main()
{
	int n;scanf("%d",&n);
	memset(f,0x3f,sizeof(f));
	f[0]=0;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=i;j*=6) f[i]=min(f[i],f[i-j]+1); 
		for(int j=1;j<=i;j*=9) f[i]=min(f[i],f[i-j]+1); 
	}
	printf("%d\n",f[n]);
	return 0;
}
### Prompt

Create a solution in Cpp for 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>
#include<cstring>
int f[100005];
int min(int x,int y) {return x<y?x:y;}
int main()
{
	int n;scanf("%d",&n);
	memset(f,0x3f,sizeof(f));
	f[0]=0;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=i;j*=6) f[i]=min(f[i],f[i-j]+1); 
		for(int j=1;j<=i;j*=9) f[i]=min(f[i],f[i-j]+1); 
	}
	printf("%d\n",f[n]);
	return 0;
}
```