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.io.*;
import java.util.*;

public class Main
{
    static int N;
    static List<Integer> nlist;
    static int[] dp;

    public static void main(String[] args)
    {
        Scanner sc = new Scanner(System.in);
        N = sc.nextInt();
        nlist = new ArrayList<>();

        //使える数のリストを作り、ソート
        int n9 = 1, n6 = 1;
        while (n9 * 9 <= N)
        {
            n9 *= 9;
            nlist.add(n9);
        }
        while (n6 * 6 <= N)
        {
            n6 *= 6;
            nlist.add(n6);
        }
        nlist.add(1);
        Collections.sort(nlist);

        //dp
        dp = new int[N + 1];
        for (int i = 0; i < N; i++)
        {
            for (int li = 0; li < nlist.size(); li++)
            {
                int v = nlist.get(li);
                if (i + v > N) break;

                if (dp[i + v] == 0) dp[i + v] = dp[i] + 1;
                else dp[i + v] = Math.min(dp[i + v], dp[i] + 1);
            }
        }
        System.out.println(dp[N]);
    }
}

