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 {

    static Scanner sc = new Scanner(System.in);
    static int[] dp = new int[0];

    public static void main(String[] args) {
        int N = sc.nextInt();
        dp = new int[N+1];
        Arrays.fill(dp, Integer.MAX_VALUE);
        dp[0] = 0;
        calc(N);
        System.out.println(dp[N]);
    }

    private static void calc(int n) {
        for (int i = 1; i <= n; i++) {
            int power = 1;
            int ans = Integer.MAX_VALUE;
            while (0 <= i - power) {
                ans = Math.min(ans, 1 + dp[i - power]);
                power *= 6;
            }

            power = 1;
            while (0 <= i - power) {
                ans = Math.min(ans, 1 + dp[i - power]);
                power *= 9;
            }
            dp[i] = ans;
        }
    }
}