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;

public class Main {

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

            // DP(動的計画法)で解く
            int[] dp = new int[n + 1];

            // n <= 100,000
            for (int i = 0; i <= n; i++) {
                dp[i] = i;
                // 6の倍数
                for (int j = 6;; j *= 6) {
                    if (i - j >= 0) {
                        if (dp[i] > dp[i - j] + 1) {
                            dp[i] = dp[i - j] + 1;
                        }
                    } else {
                        break;
                    }
                }
                // 9の倍数
                for (int j = 9;; j *= 9) {
                    if (i - j >= 0) {
                        if (dp[i] > dp[i - j] + 1) {
                            dp[i] = dp[i - j] + 1;
                        }
                    } else {
                        break;
                    }
                }
            }

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

}
