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.*;
import static java.lang.System.*;
import static java.lang.Math.*;
public class Main {
    public static void main(String[] $) {
        Scanner sc = new Scanner(in);
        int n = sc.nextInt();
        int ans = Integer.MAX_VALUE;
        int s1 = n / 6, s2 = n / 9;
        int[] TS = new int[n + 1];
        int[] TN = new int[n + 1];
        for (int i = 0; i <= n; i++) {
            int temp = i;
            while (temp / 6 > 0) {
                TS[i] += temp % 6;
                temp /= 6;
            }
            TS[i] += temp;
            temp = i;
            while (temp / 9 > 0) {
                TN[i] += temp % 9;
                temp /= 9;
            }
            TN[i] += temp;
        }
        for (int i = 0; i <= s1; i++) {
            int six = 6 * i;
            int nine = (n - six) - (n - six) % 9;
            if (six + nine <= n && six <= n && nine <= n) ans = min(ans, TS[six] + TN[nine] + (n - six - nine));
        }
        out.println(ans);
    }
}