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.

Examples

Input

127


Output

4


Input

3


Output

3


Input

44852


Output

16
n = int(raw_input())
item_9 = [59049, 6561, 729, 81, 9]
item_6 = [46656, 7776, 1296, 216, 36, 6]

def min_n(yen):
  if yen <= 5:
    return yen
  else:
    small_6 = small_9 = yen
    for x in item_9:
      if x > yen:
        continue
      else:
        small_9 = min_n(yen-x) + 1
        break
    for x in item_6:
      if x > yen:
        continue
      else:
        small_6 = min_n(yen-x) + 1
        break
  return min(small_9, small_6)

print(min_n(n))