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 static System.Console;

namespace AtCorder
{
	public class Program
	{
		public static void Main()
		{
			var n = int.Parse(ReadLine());

			int answer = int.MaxValue;
			int count = 0;

			for(int i = 0; n>= i * 6; i ++)
			{
				var sumA = i * 6;
				int a = 6;
				count = 0;
				while(a >= 6)
				{
					while(sumA >= a * 6)
					{
						a *= 6;
					}
					while(sumA >= a)
					{
						sumA -= a;
						// 6円の乗数の引き出し
						count++;
					}
					a /= 6;
				}

				var sumB = n - i * 6;
				int b = 9;
				while(b >= 9)
				{
					while(sumB >= b * 9)
					{
						b *= 9;
					}
					while(sumB >= b)
					{
						sumB -= b;
						// 9円の累乗の引き出し
						count++;
					}
					b /= 9;
				}

				// 1円の引き出し
				count += sumB;

				answer = Math.Min(count, answer);
			}

			WriteLine(answer);
		}
	}
}