#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,a[12]{1,6,36,216,1296,1296*6,1296*36,9,81,729,729*9,729*81};cin>>n;int dp[100010];
	for(int i=0;i<100010;i++) dp[i]=i;
	sort(a,a+10);
	for(int i=0;i<100010;i++){
		for(int j=0;j<12;j++){
			if(i>=a[j]) dp[i]=min(dp[i],dp[i-a[j]]+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<bits/stdc++.h>
using namespace std;
int main(){
	int n,a[12]{1,6,36,216,1296,1296*6,1296*36,9,81,729,729*9,729*81};cin>>n;int dp[100010];
	for(int i=0;i<100010;i++) dp[i]=i;
	sort(a,a+10);
	for(int i=0;i<100010;i++){
		for(int j=0;j<12;j++){
			if(i>=a[j]) dp[i]=min(dp[i],dp[i-a[j]]+1);
		}
	}
	cout<<dp[n]<<endl;
}

```