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 Kotlin (1.0.0) (judge verdict: Runtime Error)

package point300

//参考資料
//https://qiita.com/drken/items/ace3142967c4f01d42e9

val memo = mutableMapOf<Int, Int>()
fun main(args: Array<String>) {
    val n = readLine()!!.toInt()
    println(recur(n))
}

fun recur(n: Int): Int {
    if (n == 0) return 0
    if (memo.containsKey(n)) return memo[n]!!
    var res = n
    if (n < 6) {
        res = Math.min(res, recur(n - 1) + 1)
    }

    var pow6 = 6
    while (pow6 <= n) {
        res = Math.min(res, recur(n - pow6) + 1)
        pow6 *= 6
    }

    var pow9 = 9
    while (pow9 <= n) {
        res = Math.min(res, recur(n - pow9) + 1)
        pow9 *= 9
    }

    memo[n] = res
    return res
}