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.Arrays;
import java.util.Scanner;

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

            int[] dp = new int[N + 1];
            Arrays.fill(dp, (int) 1e9);
            dp[0] = 0;
            for (int i = 0; i < dp.length; i++) {
                for (int j = 1; i + j < dp.length; j += (int) 1e9) {
                    dp[i + j] = Math.min(dp[i + j], dp[i] + 1);
                }
                for (int j = 6; i + j < dp.length; j *= 6) {
                    dp[i + j] = Math.min(dp[i + j], dp[i] + 1);
                }
                for (int j = 9; i + j < dp.length; j *= 9) {
                    dp[i + j] = Math.min(dp[i + j], dp[i] + 1);
                }
            }

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