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 Ruby (2.3.3) (judge verdict: Accepted)

Sixes = [0, 6, 36, 216, 1296, 7776, 46656].reverse
Nines = [0, 9, 81, 729, 6561, 59049].reverse

Draws = [0, 1, 2, 3, 4, 5, 1, 2, 3, 1, 2, 3,
         2, 3, 4, 2, 3, 4, 2, 3, 4, 3, 4, 5,
         3, 4, 5, 3, 4, 5, 4, 5, 6, 4, 5, 6, 1]


def count_draw(d)
  return Draws[d] if d <= 36

  s = Sixes.find do |i|
    i <= d
  end
  sn = count_draw(d - s) + 1

  n = Nines.find do |i|
    i <= d
  end
  nn = count_draw(d - n) + 1

  [sn, nn].min
end

def main

  # 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36
  # 1 1 1          2  2  2  1  1  1           2  2  2  1  1  1           2  2  2  1  1  1 *1
  #       1  1  1           1  1  1  2  2  2  1  1  1  2  2  2  3  3  3  2  2  2  3  3  3
  #   1 2    1  2     1  2     1  2     1  2     2  1     1  2     1  2     1  2     1  2

  #
  draw = ARGF.gets.chomp.to_i

  d = count_draw(draw)

  puts d
end

if __FILE__ == $0
  main
end