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){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        List<Integer> list = new ArrayList<>();
        list.add(1);

        int tmp = 1;
        while (true) {
            tmp *= 6;
            if (tmp > n) break;
            list.add(tmp);
        }

        tmp = 1;
        while (true) {
            tmp *= 9;
            if (tmp > n) break;
            list.add(tmp);
        }

        boolean[][] dp = new boolean[20][n + 1];
        dp[0][0] = true;
        for (int i = 1; i < dp.length; i++) {
            for (int j = 0; j < list.size(); j++) {
                for (int k = 0; k < dp[0].length; k++) {
                    if (k - list.get(j) >= 0 && dp[i - 1][k - list.get(j)]) {
                        dp[i][k] = true;
                    }
                }
            }
        }

        for (int i = 0; i < dp.length; i++) {
            if (dp[i][n]) {
                System.out.println(i);
                return;
            }
        }
    }
}
