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.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		try (Scanner scanner = new Scanner(System.in)) {
			int N = scanner.nextInt();
			int[] x = new int[N+1];

			for (int i = 1; i <= N; i++) {
				x[i] = dpCore(i, x);
			}
			System.out.println(x[N]);
		};
	}

	static int dpCore(int target, int[] cache) {
		List<Integer> candidates = new ArrayList<>();
		for (int i = 1; i <= target; i*=9) {
			candidates.add(cache[target-i]+1);
		}
		for (int i = 1; i <= target; i*=6) {
			candidates.add(cache[target-i]+1);
		}
		return candidates.stream().mapToInt(i -> i).min().orElse(999999);
	}
}
