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)

import numpy as np

N = int(input())

pow6 = [1]
pow9 = [1]

i=0
while pow6[i]*6 <= N:
    pow6.append(6*pow6[i])
    i += 1

i=0
while pow9[i]*9 <= N:
    pow9.append(9*pow9[i])
    i += 1

list_69 = pow6 + pow9
list_69 = sorted(list_69)


ans = 0
while N >= 6:

    list_69 = [j for j in list_69 if j <= N]

    N -= list_69[-1]
    ans = ans + 1


ans = ans + N
print(ans)