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.*;

public class Main {

    public static void main(String[] args) {
        // write your code here
        Scanner sc = new Scanner(System.in);

        // educational dp 2

        int n = sc.nextInt();

        long[] dp = new long[n + 1];
        for (int i = 1; i <= n; i++) {
            dp[i] = i;
        }

        int six = 1;

        while (six * 6 <= n) {
            six *= 6;
            for (int i = 0; i <= n - six; i++) {
                dp[i + six] = Math.min(dp[i + six], dp[i] + 1);
            }
        }

        int nine = 1;

        while (nine * 9 <= n) {
            nine *= 9;
            for (int i = 0; i <= n - nine; i++) {
                dp[i + nine] = Math.min(dp[i + nine], dp[i] + 1);
            }
        }
        System.out.println(dp[n]);
    }
}