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

public class Main {

	/** 引き出しのできる数字 */
	private static final int[] NUMBERS = new int[] { 1, 6, 9 };

	public static void main(String[] args) {
		try (Scanner scanner = new Scanner(System.in)) {
			int n = scanner.nextInt();
			// dp[i]は金額iを引き出すのに必要な最小回数
			int[] dp = new int[n + 1];
			Arrays.fill(dp, Integer.MAX_VALUE);
			dp[0] = 0;
			IntStream.rangeClosed(1, n).forEach(i -> {
				for (int number : NUMBERS) {
					int current = number;
					while (i >= current) {
						dp[i] = Math.min(dp[i], dp[i - current] + 1);
						if (number > 1) {
							current *= number;
						} else {
							break;
						}
					}
				}
			});
			System.out.println(dp[n]);
		}
	}
}
