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
#include <iostream>
using namespace std;

int main() {
	int n;
	cin >> n;
	int ans = 1001001001;
	for (int i = 0; i <= n; i++) {
		int n6 = i;
		int n9 = n - i;
		int sum = 0;
		while (n6 != 0) {
			sum += n6 % 6;
			n6 /= 6;
		}
		while (n9 != 0) {
			sum += n9 % 9;
			n9 /= 9;
		}
		ans = min(ans, sum);
	}
	cout << ans << endl;
	return 0;
}