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

class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int min = n;
        for (int i = 0; i <= n; i++) {
            int six = i;
            int nine = n - i;
            int cnt = 0;
            int num = 6;
            while (true) {
                if (num * 6 > six) {
                    break;
                }
                num *= 6;
            }
            while (true) {
                cnt += six / num;
                six %= num;
                num = num / 6;
                if (num == 1) {
                    cnt += six;
                    break;
                }
            }
            num = 9;
            // 最大まで上げる
            while (true) {
                if (num * 9 > nine) {
                    break;
                }
                num *= 9;
            }
            while (true) {
                cnt += nine / num;
                nine %= num;
                num = num / 9;
                if (num == 1) {
                    cnt += nine;
                    break;
                }
            }
            min = Math.min(cnt, min);

        }
        System.out.println(min);
        sc.close();
    }
}