// C - Strange Bank
#include <bits/stdc++.h>
using namespace std;

int main(){
	int coin[12] = {1,6,36,216,1296, 7776,46656,9,81,729,6561,59049};
	int inf = 1e9;
	int n; cin>>n;
	vector<int> dp(n+1, inf);
	dp[0] = 0;
	for(int c:coin)
		for(int yen=c; yen<=n; ++yen)
			dp[yen] = min(dp[yen], dp[yen-c] + 1);
	cout<< dp[n] <<endl;
}

### 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
// C - Strange Bank
#include <bits/stdc++.h>
using namespace std;

int main(){
	int coin[12] = {1,6,36,216,1296, 7776,46656,9,81,729,6561,59049};
	int inf = 1e9;
	int n; cin>>n;
	vector<int> dp(n+1, inf);
	dp[0] = 0;
	for(int c:coin)
		for(int yen=c; yen<=n; ++yen)
			dp[yen] = min(dp[yen], dp[yen-c] + 1);
	cout<< dp[n] <<endl;
}

```