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
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int value = sc.nextInt();

		System.out.println(withdraw(value));

	}

	static int withdraw(int value) {
		if (value == 0) {
			return 0;
		}
		if (value == 1) {
			return 1;
		}

		int num9 = (int) Math.pow(9, 5);
		int num6 = (int) Math.pow(6, 6);

		int num = 0;

		while (num9 > value) {
			num9 /= 9;
		}

		while (num6 > value) {
			num6 /= 6;
		}

		int tmp9 = withdraw(value - num9);
		int tmp6 = withdraw(value - num6);

		if (tmp9 > tmp6) {
			num = tmp6;
		} else {
			num = tmp9;
		}

		return num + 1;
	}

}
