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

int main(){
	int N;
	cin >> N;

	int res = N;
	for (int i = 0; i <= N; i++){
		int pre = 0;

		int x = i;
		while (x > 0){
			pre += x%6;
			x /= 6;
		}

		x = N-i;
		while (x > 0){
			pre += x%9;
			x /= 9;
		}

		res = min(res, pre);
	}

	cout << res << endl;
	return 0;
}

### Prompt

Please create a solution in Cpp 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
#include <bits/stdc++.h>
typedef long long ll;
 
using namespace std;

int main(){
	int N;
	cin >> N;

	int res = N;
	for (int i = 0; i <= N; i++){
		int pre = 0;

		int x = i;
		while (x > 0){
			pre += x%6;
			x /= 6;
		}

		x = N-i;
		while (x > 0){
			pre += x%9;
			x /= 9;
		}

		res = min(res, pre);
	}

	cout << res << endl;
	return 0;
}

```