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 Python (3.4.3) (judge verdict: Wrong Answer)

N = int(input())


def hoge(kind, target):
    i = 0
    while kind**i <= target:
        i += 1
    rest = target - kind**(i - 1)
    return i - 1, rest


target = N
count = 0
while target >= 36:
    six_i, six_rest = hoge(6, target)
    nine_i, nine_rest = hoge(9, target)
    if six_rest < nine_rest:
        target = six_rest
    else:
        target = nine_rest
    count += 1

Min = float("inf")
for i in range(target // 9 + 3):
    temp = target - i * 9
    for j in range(temp // 6 + 1):
        k = temp - j * 6
        Min = min(Min, i + j + k)

print(count + Min)