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

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		StringBuilder sb = new StringBuilder();
		TreeSet<Integer> ts = new TreeSet<>();
		ts.add(0);
		ts.add(1);
		for (int i = 6; i <= 100000; i = i * 6) {
			ts.add(i);
		}
		for (int i = 9; i <= 100000; i = i * 9) {
			ts.add(i);
		}
		int[] money = new int[ts.size()];
		int cnt = 0;
		for (int i : ts) {
			money[cnt] = i;
			cnt++;
		}
		int n = sc.nextInt();
		int[][] dp = new int[ts.size() + 1][n + 1];
		Arrays.fill(dp[0], 100010);
		dp[0][0] = 0;
		int i = 1;
		for (; i < ts.size(); i++) {
			if (money[i] > n) {
				break;
			}
			for (int j = 0; j <= n; j++) {
				if (money[i] > j) {
					dp[i][j] = dp[i - 1][j];
				} else {
					dp[i][j] = Math.min(dp[i - 1][j], dp[i][j - money[i]] + 1);
				}
			}

		}
		System.out.println(dp[i-1][n]);
	}
}
