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

public class Main {
    public static void main(final String[] args) {
        final Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();

        final List<Integer> divide = new ArrayList<>();

        for (int i = 1; ; i++) {
            final int tmp = (int) Math.pow(9, i);
            if (tmp > n) {
                break;
            }
            divide.add(tmp);
        }

        for (int i = 1; ; i++) {
            final int tmp = (int) Math.pow(6, i);
            if (tmp > n) {
                break;
            }
            divide.add(tmp);
        }

        divide.add(1);
        divide.sort(Comparator.naturalOrder());

        final int[][] dpTable = new int[divide.size()][n + 1];
        for (int i = 1; i < n + 1; i++) {
            dpTable[0][i] = i;
        }

        for (int i = 1; i < divide.size(); i++) {
            final int d = divide.get(i);
            for (int j = 0; j < n + 1; j++) {
                if (j < d) {
                    dpTable[i][j] = dpTable[i - 1][j];
                    continue;
                }

                dpTable[i][j] = Math.min(dpTable[i - 1][j], dpTable[i][j - d] + 1);
            }
        }

        System.out.println(dpTable[divide.size() - 1][n]);
    }
}
