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

int f(int yen, int coin, int cnt=0){
	while(yen > 0){ cnt += yen % coin; yen /= coin; }
	return cnt;
}

int main(){
	int n; cin>>n;
	int ans = n;
	for(int yen6=0; yen6<=n; ++yen6)
		ans = min(ans, f(n-yen6, 9, f(yen6, 6)));
	cout<< ans <<endl;
}

### Prompt

Your task is to create 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 f(int yen, int coin, int cnt=0){
	while(yen > 0){ cnt += yen % coin; yen /= coin; }
	return cnt;
}

int main(){
	int n; cin>>n;
	int ans = n;
	for(int yen6=0; yen6<=n; ++yen6)
		ans = min(ans, f(n-yen6, 9, f(yen6, 6)));
	cout<< ans <<endl;
}

```