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) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[] p = {1, 6, 9, 36, 81, 216, 729, 1296, 6561, 7776, 46656, 59049};
        int[] dp = new int[n+1];

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < p.length; j++) {
                if (i+p[j] > n) {
                    break;
                }

                if (dp[i+p[j]] == 0) {
                    dp[i+p[j]] = dp[i]+1;
                } else {
                    dp[i+p[j]] = Math.min(dp[i+p[j]], dp[i]+1);
                }
            }
        }

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