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.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int count = 0;

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

        for (int i = 6; i <= N; i *= 6) {
            list.add(i);
        }

        for (int i = 9; i <= N; i *= 9) {
            list.add(i);
        }

        Collections.sort(list);

        int[] dp = new int[N+1];

        for (int i = 0; i < N+1; i++) {
            dp[i] = i;
        }

        for (int j = 1; j < list.size(); j++) {
            int item = list.get(j);

            for (int i = item; i < dp.length; i++) {
                if (dp[i - item] + 1 < dp[i]) {
                    dp[i] = dp[i - item] + 1;
                }
            }
        }

        System.out.println(dp[N]);
    }
}