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 dp[] = new int[n + 1];
        dp[0] = 0;
        dp[1] = 1;
        for (int i = 1; i < n + 1; i++) {
            dp[i] = 1 + dp[i - 1];
            int j = 6;
            while (j <= i) {
                int tmp = 1 + dp[i - j];
                j *= 6;
                dp[i] = Math.min(dp[i], tmp);
            }
            j = 9;
            while (j <= i) {
                int tmp = 1 + dp[i - j];
                j *= 9;
                dp[i] = Math.min(dp[i], tmp);
            }
        }
        System.out.println(dp[n]);

    }
}