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

public class Main
{
	private static Map<Integer,Integer> intMap = new HashMap<>();

	public static void main(String[] args)
	{
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		sc.close();
		int ans = solve(n);

		System.out.println(ans);
	}

	public static int solve(int n)
	{

		if(intMap.containsKey(n)){
			return intMap.get(n);
		}
		int ans = n;
		int n6 = getNext(n, 6);
		int n9 = getNext(n, 9);
		if (n < 6) {
			return n;
		} else if (n == 6 || n == 9) {
			return 1;
		} else if (n <9) {
			ans = Math.min(ans, solve(n6) + 1);
			ans = Math.min(ans, n + 1);
		} else {
			ans = Math.min(ans, solve(n6) + 1);
			ans = Math.min(ans, solve(n9) + 1);
		}
		intMap.put(n, ans);
		return ans;
	}

	private static int getNext(int n, int i)
	{
		int ans = n;
		int jp = 0;
		int j = i;
		while(true) {
			if (j > n) break;
			jp = j;
			j *=i;
		}
		return n - jp;
	}
}
