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 {
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int[] divisors = {1, 6, 9, 36, 81, 216, 729, 1296, 6561, 7776, 46656, 59049};

		int amount = Integer.parseInt(scanner.nextLine());
		short[] numProcedures = new short[amount + 1];
		numProcedures[0] = 0;

		for (int aIdx = 1; aIdx <= amount; aIdx++) {
			short minNumProcedure = Short.MAX_VALUE;
			for (int dIdx = 0; dIdx < divisors.length && divisors[dIdx] <= aIdx; dIdx++) {
				short tmpNumProcedure = (short) (numProcedures[aIdx - divisors[dIdx]] + 1);
				if (minNumProcedure > tmpNumProcedure) minNumProcedure = tmpNumProcedure;
			}
			numProcedures[aIdx] = minNumProcedure;
		}

		System.out.println(numProcedures[amount]);
	}
}
