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: Wrong Answer)

using System;

namespace AtCoderConsole
{
    class Program
    {
        static void Main(string[] args)
        {
            // 標準入力から1行取得
            //            string input = Console.ReadLine();
            //            int n = int.Parse(input);
            int n = 44852;

            // 引き出せるお金
            // 1円
            // 6円、36円(=6^2)、216円(=6^3)、1296円(=6^4)、7776円(=6^5)、46656円(=6^6)
            // 9円、81円(=9^2)、729円(=9^3)、6561円(=9^4)、59049円(9^5)
            int[] hikidashiGaku = { 59049, 46656, 7776, 6561, 1296, 729, 216, 81, 36, 9, 6, 1 };

            int count = 0;

            while (n != 0)
            {
                if (n == 12)
                {
                    count += 2;
                    n = 0;
                }
                else if (n == 13)
                {
                    count += 3;
                    n = 0;
                }
                else if (n == 14)
                {
                    count += 4;
                    n = 0;
                }
                for (int i=0; i < hikidashiGaku.Length; i++)
                {
                    if (n >= hikidashiGaku[i])
                    {
                            n -= hikidashiGaku[i];
                            count++;
                            i = 0;
                    }
                }
            }

            // 標準出力に出力
            Console.WriteLine(count);
        }
    }
}