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 void main(Scanner sc) {
        int n = sc.nextInt();

        int ans = n;
        for (int i = 0; i <= n; i++) {
            ans = Math.min(ans, count(i, 6) + count(n - i, 9));
        }

        System.out.println(ans);
    }

    private int count(int money, int radix) {
        char array[] = Integer.toString(money, radix).toCharArray();

        int cnt = 0;
        for (int i = 0; i < array.length; i++) {
            cnt += array[i] - '0';
        }

        return cnt;
    }

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