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 hikidashi(n):
    if 35 >= n:
        tmp1 = n//9 + (n%9)//6 + (n%9)%6
        tmp2 = n//6 + n%6

        if tmp1 == tmp2:
            if n >= 9:
                return 9
            elif n >= 6:
                return 6
            else:
                return 1
        elif tmp1 > tmp2:
            if n >= 6:
                return 6
            else:
                return 1
        else:
            if n >= 9:
                return 9
            else:
                return 1

    else:
        count = 0
        while True:
            tmp = pow(9, count)
            if tmp > n:
                break
            n9 = tmp
            count += 1

        count = 0
        while True:
            tmp = pow(6, count)
            if tmp > n:
                break
            n6 = tmp
            count += 1
        return max(n6, n9)


result = 0
while N != 0:
    result += 1
    N = N - hikidashi(N)
print(result)