Problem:
Score : 300 points

Problem Statement

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.

Sample Input 1

127

Sample Output 1

4

By withdrawing 1 yen, 9 yen, 36(=6^2) yen and 81(=9^2) yen, we can withdraw 127 yen in four operations.

Sample Input 2

3

Sample Output 2

3

By withdrawing 1 yen three times, we can withdraw 3 yen in three operations.

Sample Input 3

44852

Sample Output 3

16

Solution in C# (Mono 4.6.2.0) (judge verdict: Accepted)

using System;

namespace atcorder
{
    class MainClass
    {
        public static void Main(string[] args)
        {
            atcorder.Strange_Bank.Run();
        }
    }
    public class Strange_Bank
    {
        public Strange_Bank()
        {
        }
        public static void Run(){
            int N = int.Parse(Console.ReadLine());
            //動的に考えよう
            int[] list = new int[100001];
            int[] pow9 = new int[6];
            int[] pow6 = new int[6];
            for (int i = 0; i < 6;i++){
                pow9[i] = (int)Math.Pow(9, i + 1);
                pow6[i] = (int)Math.Pow(6, i + 1);
            }
            list[1] = 1;
            for (int i = 2; i <= N;i++){
                int min = 100000;
                for (int j = 0; j < 6;j++){
                    if (i - pow9[j] >= 0){
                        if(min>list[i - pow9[j]])min = list[i - pow9[j]];
                    } 
                    else break;
                }
                for (int j = 0; j < 6; j++)
                {
                    if (i - pow6[j] >= 0){
                        if (min > list[i - pow6[j]]) min = list[i - pow6[j]];
                    } 
                    else break;
                }
                if (min > list[i - 1]) min = list[i - 1];
                list[i] = min + 1;
            }
            Console.WriteLine(list[N]);
        }
    }
}