#include<iostream>
#include<algorithm>
using namespace std;

int n;
int dp[100005];

void solve(int a) {
	for (int i = a; i <= n; i *= a) {
		for (int j = 0; j + i <= n; j++)
			dp[j + i] = min(dp[j + i], dp[j] + 1);
	}
}

int main() {
	cin >> n;
	for (int i = 0; i <= n; i++)
		dp[i] = i;
	dp[0] = 0;
	
	solve(6);
	solve(9);

	cout << dp[n] << endl;
	return 0;
}
### Prompt

Develop a solution in CPP 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<iostream>
#include<algorithm>
using namespace std;

int n;
int dp[100005];

void solve(int a) {
	for (int i = a; i <= n; i *= a) {
		for (int j = 0; j + i <= n; j++)
			dp[j + i] = min(dp[j + i], dp[j] + 1);
	}
}

int main() {
	cin >> n;
	for (int i = 0; i <= n; i++)
		dp[i] = i;
	dp[0] = 0;
	
	solve(6);
	solve(9);

	cout << dp[n] << endl;
	return 0;
}
```