#include<iostream>
#include<algorithm>
using namespace std;
int dp[1<<17];
int n;
int main()
{
	for(int i=1;i<1<<17;i++)dp[i]=1e9;cin>>n;
	for(int i=0;i<n;i++)
	{
		dp[i+1]=min(dp[i+1],dp[i]+1);
		for(int r=6;i+r<=n;r*=6)dp[i+r]=min(dp[i+r],dp[i]+1);
		for(int r=9;i+r<=n;r*=9)dp[i+r]=min(dp[i+r],dp[i]+1);
	}
	cout<<dp[n]<<endl;
}
### 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<iostream>
#include<algorithm>
using namespace std;
int dp[1<<17];
int n;
int main()
{
	for(int i=1;i<1<<17;i++)dp[i]=1e9;cin>>n;
	for(int i=0;i<n;i++)
	{
		dp[i+1]=min(dp[i+1],dp[i]+1);
		for(int r=6;i+r<=n;r*=6)dp[i+r]=min(dp[i+r],dp[i]+1);
		for(int r=9;i+r<=n;r*=9)dp[i+r]=min(dp[i+r],dp[i]+1);
	}
	cout<<dp[n]<<endl;
}
```