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 {

	static int[] memo;

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		memo = new int[100010];
		for(int i = 0 ; i < 100010 ; i++) {
			memo[i] = -1;
		}
		System.out.println(rec(n));
	}

	static int rec(int x) {
		if(x == 0) return 0;
		if(memo[x] != -1) return memo[x];
		int res = x;
	    for (int pow6 = 1; pow6 <= x; pow6 *= 6) res = Math.min(res, rec(x - pow6) + 1);
	    for (int pow9 = 1; pow9 <= x; pow9 *= 9) res = Math.min(res, rec(x - pow9) + 1);
		return memo[x] = res;
	}
}
