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 sc = new Scanner(System.in);
		int n = Integer.parseInt(sc.next());
		if (n < 6) {
			System.out.println(n);
			return;
		}
		System.out.println(r(n, 0));
	}
	public static int r(int m, int ans) {
		if (m < 6) return ans + m;
		int a = 0;
		int i = 6;
		while (i * 6 <= m)
			i *= 6;
		int j = 9;
		while (j * 9 <= m)
			j *= 9;
		if (m > 8) {
			return Math.min(r(m - i, ans + 1), r(m - j, ans + 1));
		}
		else
			return r(m - i, ans + 1);
	}
}