#include<bits/stdc++.h>
using namespace std;
int n,cnt,a[20],f[100001];
int get(int k)
{
	if(f[k])return f[k];
	int res=k;
	for(int i=cnt;i>=1;i--)
	  if(k>=a[i])res=min(res,1+get(k-a[i]));
	return f[k]=res;
}
int main()
{
	int k=6;
	while(k<100000)a[++cnt]=k,k*=6;
	k=9;
	while(k<100000)a[++cnt]=k,k*=9;
	cin>>n;cout<<get(n)<<endl;
	return 0;
}
### Prompt

Your challenge is to write 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,a[20],f[100001];
int get(int k)
{
	if(f[k])return f[k];
	int res=k;
	for(int i=cnt;i>=1;i--)
	  if(k>=a[i])res=min(res,1+get(k-a[i]));
	return f[k]=res;
}
int main()
{
	int k=6;
	while(k<100000)a[++cnt]=k,k*=6;
	k=9;
	while(k<100000)a[++cnt]=k,k*=9;
	cin>>n;cout<<get(n)<<endl;
	return 0;
}
```