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;
using System.Linq;//リストの使用
using System.Collections.Generic;
class Program
{
	static void Main()
	{
		long n = long.Parse(Console.ReadLine());//int.Parseは文字列を整数に変換。
		long[] dp = new long[n+1];//iとするための最小操作回数
    dp[0] = 0;

    for(long i = 1; i <= n; i++)
    {
    dp[i] = long.MaxValue;
      for(long divide = 1; divide > 0; divide++)
      {
        if(i-(long)Math.Pow(6, divide) >= 0) 
        {
          dp[i] = Math.Min(dp[i], dp[i-(long)Math.Pow(6, divide)] + 1);
        }else break;
      }
      for(long divide = 1; divide > 0; divide++)
      {
        if(i-(long)Math.Pow(9, divide) >= 0) 
        {
          dp[i] = Math.Min(dp[i], dp[i-(long)Math.Pow(9, divide)] + 1);
        }else break;
      }
      dp[i] = Math.Min(dp[i], dp[i-1] + 1);
    }
    
		Console.WriteLine(dp[n]);
	}
}