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.*;

public class Main {
	public static void main(String[] args) {
		new Main().execute();
	}

	public void execute() {
		Scanner sc = new Scanner(System.in);
		final int N = sc.nextInt();

		int[] dpTable = new int[N + 1];

		HashSet<Integer> sixPow = new HashSet<>();
		HashSet<Integer> ninePow = new HashSet<>();

		int sp = 6;
		while (sp <= N) {
			sixPow.add(sp);
			sp *= 6;
		}

		int np = 9;
		while (np <= N) {
			ninePow.add(np);
			np *= 9;
		}
		dpTable[1] = 1;
		for (int i = 2; i <= N; i++) {
			if (sixPow.contains(i) || ninePow.contains(i)) {
				dpTable[i] = 1;
				continue;
			}

			dpTable[i] = dpTable[i - 1] + 1;
			for (Integer s : sixPow) {
				if (s < i) {
					dpTable[i] = Math.min(dpTable[i], dpTable[i - s] + 1);
				}
			}

			for (Integer n : ninePow) {
				if (n < i) {
					dpTable[i] = Math.min(dpTable[i], dpTable[i - n] + 1);
				}
			}
		}
		System.out.println(dpTable[N]);

		sc.close();
	}

}
