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;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace Practice
{
    class Program
    {
#if false
        static void Main(string[] args)
        {
            string szLine = Console.ReadLine();
            int n = int.Parse(szLine);

            if( n <= 999)
            {
                Console.WriteLine("ABC");
            }
            else
            {
                Console.WriteLine("ABD");
            }
        }
#endif
#if false
        static void Main(string[] args)
        {
            string szLine = Console.ReadLine();
            string[] szArr = szLine.Split(' ');

            int a = int.Parse(szArr[0]);
            int b = int.Parse(szArr[1]);

            int x = 0;
            int k = b - a - 1;// 級数の魔法計算よりk板目とk+1番目の比較だ

            x = k * (k + 1) / 2 - a;
            Console.WriteLine(x);
        }
#endif
        static void Main(string[] args)
        {
            string szLine = Console.ReadLine();
            int n = int.Parse(szLine);

            // 高速化のためtable作成
            List<int> table6 = new List<int>();
            List<int> table9 = new List<int>();

            int idx = 0;
            table6.Add(6);
            table9.Add(9);
            while (true)
            {
                table6.Add(table6[idx] * 6);
                table9.Add(table9[idx] * 9);
                
                idx++;
                if(table9[idx] >= n)
                {
                    break;
                }
            }

            List<int> table = new List<int>();
            table.Add(1);
            table.AddRange(table6);
            table.AddRange(table9);
            table.Sort();
            table.Reverse();

            int x = 0;
            int remain = n;
            for(int i=0;i<table.Count;++i)
            {
                int tmp = table[i];
                int count = remain / tmp;
                remain -= tmp * count;
                x += count;
            }

            Console.WriteLine(x);
        }
    }
}