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# (.NET Core 3.1.201) (judge verdict: Accepted)

using System;
using System.IO;

class Solve {
    static void Main(string[] args) {
        var max = int.Parse(Console.ReadLine()) + 1;
        var dp = new int[max];
        for (int i = 0; i < max; i++) {
            dp[i] = max;
        }
        dp[0] = 0;
        for (int i = 0; i < max; i++) {
            for (int m_nine = 1; i + m_nine < max; m_nine *= 9) {
                dp[i + m_nine] = Math.Min(dp[i + m_nine], dp[i] + 1);
            }

            for (int m_six = 1; i + m_six < max; m_six *= 6) {
                dp[i + m_six] = Math.Min(dp[i + m_six], dp[i] + 1);
            }
        }
        var answer = dp[^1];
        var writer = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
        Console.SetOut(writer);
        Console.WriteLine(answer);
        Console.Out.Flush();
    }
}