#include <bits/stdc++.h>
using namespace std;

long long n, dp[100001], a[12]={1, 6, 9, 36, 81, 216, 729, 1296, 6561, 7776, 46656, 59049};
int main(){
	cin >> n;
	for(int i = 1; i <= n; i++){
		dp[i] = INT_MAX;
		for(int j = 0; j < 12; j++){
			if(i-a[j] >= 0) dp[i] = min(dp[i], dp[i-a[j]]+1);
		}
	}
	cout << dp[n];
}
### Prompt

Please provide a CPP coded solution to the problem described below:

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;

long long n, dp[100001], a[12]={1, 6, 9, 36, 81, 216, 729, 1296, 6561, 7776, 46656, 59049};
int main(){
	cin >> n;
	for(int i = 1; i <= n; i++){
		dp[i] = INT_MAX;
		for(int j = 0; j < 12; j++){
			if(i-a[j] >= 0) dp[i] = min(dp[i], dp[i-a[j]]+1);
		}
	}
	cout << dp[n];
}
```