#include<bits/stdc++.h>
using namespace std;
const int N=1262145;
int n,f[N],a[N],tot;
int main()
{
	memset(f,7,sizeof(f));
	cin>>n;
	f[0]=0;
	a[++tot]=1;
	for(int x=6;x<=100000;x*=6)
	  a[++tot]=x;
	for(int x=9;x<=100000;x*=9)
	  a[++tot]=x;
	for(int i=0;i<=n;i++){
		for(int j=1;j<=tot;j++)
		  f[i+a[j]]=min(f[i+a[j]],f[i]+1);
	}
	cout<<f[n]<<endl;
	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<bits/stdc++.h>
using namespace std;
const int N=1262145;
int n,f[N],a[N],tot;
int main()
{
	memset(f,7,sizeof(f));
	cin>>n;
	f[0]=0;
	a[++tot]=1;
	for(int x=6;x<=100000;x*=6)
	  a[++tot]=x;
	for(int x=9;x<=100000;x*=9)
	  a[++tot]=x;
	for(int i=0;i<=n;i++){
		for(int j=1;j<=tot;j++)
		  f[i+a[j]]=min(f[i+a[j]],f[i]+1);
	}
	cout<<f[n]<<endl;
	return 0;
}
```