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

class Main {
    static int[] memo;

    public static int rec(int n) {
        if (n == 0) { return 0; }
        if (memo[n] != 0) { return memo[n]; }

        int[] coins = {
            1,
            6,
            6 * 6,
            6 * 6 * 6,
            6 * 6 * 6 * 6,
            6 * 6 * 6 * 6 * 6,
            6 * 6 * 6 * 6 * 6 * 6,
            9,
            9 * 9,
            9 * 9 * 9,
            9 * 9 * 9 * 9,
            9 * 9 * 9 * 9 * 9
        };

        List<Integer> answers = new ArrayList<>();
        for (int coin : coins) {
            if (n - coin >= 0) {
                answers.add(rec(n - coin) + 1);
            }
        }

        memo[n] = Collections.min(answers);
        return memo[n];
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        final int N = sc.nextInt();

        memo = new int[100001];

        System.out.println(rec(N));
    }
}