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)

from sys import stdin

def Base_10_to_n(X, n):
    if (int(X/n)):
        return Base_10_to_n(int(X/n), n)+str(X%n)
    return str(X%n)

def sum_num(num):
    sum = 0
    for i in range(len(num)):
        sum += int(num[i])
    return sum

N = int(stdin.readline().rstrip())

x = 0

while N != 0:
    x_6 = Base_10_to_n(N, 6)
    x_9 = Base_10_to_n(N, 9)
    if (len(x_9) > len(x_6)):
        N -= 9**(len(x_9)-1)
        x += 1
    if (len(x_9) == len(x_6)):
        if (sum_num(x_9) <= sum_num(x_6)):
            N -= 9**(len(x_9)-1)
            x += 1
        else:
            N -= 6**(len(x_6)-1)
            x += 1
    else:
        N -= 6**(len(x_6)-1)
        x += 1

print(x)