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 {
    static int[][] dp;
    static int[] yen = new int[]{6, 36, 216, 36 * 36, 36 * 36 * 6, 216*216, 9, 81, 729, 81 * 81, 81 * 729, 729* 729};

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        dp = new int[yen.length + 1][100001];

        for (int i = 0; i < dp[0].length; i++) {
            dp[0][i] = i;
        }

        for (int i = 0; i < yen.length; i++) {
            for (int j = 1; j < dp[0].length; j++) {
                if (j - yen[i] >= 0) {
                    dp[i + 1][j] = Math.min(dp[i + 1][j - yen[i]] + 1, dp[i][j]);
                }
                else {
                    dp[i + 1][j] = dp[i][j];
                }
            }
        }
        System.out.println(dp[dp.length - 1][n]);
    }
}