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();

        TreeSet<Integer> moneySet = new TreeSet<>();
        moneySet.add(1);
        int tmp = 6;
        while (tmp <= 100000) {
            moneySet.add(tmp);
            tmp *= 6;
        }
        tmp = 9;
        while (tmp <= 100000) {
            moneySet.add(tmp);
            tmp *= 9;
        }

        Set<Integer> set = new HashSet<>();
        set.add(0);
        for (int cnt = 0;; cnt++) {
            if (set.contains(n)) {
                System.out.println(cnt);
                break;
            }

            Integer array[] = set.toArray(new Integer[0]);
            set.clear();
            for (Integer num : array) {
                for (Integer money : moneySet) {
                    set.add(num + money);
                }
            }
        }
    }

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