#include<cstdio>
#define INF 0x3fffffff
#define MAXCF 10
int n,ans=INF;
int main() {
	scanf("%d",&n);
	for(int i=0;i<=n;i+=9) {
		int j=(n-i)/6*6,k=n-i-j;
		int tmpi=i,tmpj=j,cnti=0,cntj=0;
		while(tmpi) cnti+=tmpi%9,tmpi/=9;
		while(tmpj) cntj+=tmpj%6,tmpj/=6;
		int tmp=cnti+cntj+k;
		if(tmp<ans) ans=tmp;
	}
	printf("%d\n",ans);
	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<cstdio>
#define INF 0x3fffffff
#define MAXCF 10
int n,ans=INF;
int main() {
	scanf("%d",&n);
	for(int i=0;i<=n;i+=9) {
		int j=(n-i)/6*6,k=n-i-j;
		int tmpi=i,tmpj=j,cnti=0,cntj=0;
		while(tmpi) cnti+=tmpi%9,tmpi/=9;
		while(tmpj) cntj+=tmpj%6,tmpj/=6;
		int tmp=cnti+cntj+k;
		if(tmp<ans) ans=tmp;
	}
	printf("%d\n",ans);
	return 0;
}
```