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: Runtime Error)

i = gets.chomp.to_i
six_ary = []
six_target = true
nine_ary = []
nine_target = true
i_six = 0
i_nine = 0
ans = 0
while 100000 >= ans do
  i_six += 1
  six_ary << 6**i_six
  ans = 6**i_six
end
six_ary.pop
ans = 0
while 100000 >= ans do
  i_nine += 1
  nine_ary << 9**i_nine
  ans = 9**i_nine
end
nine_ary.pop

nums = six_ary + nine_ary
nums << 1
nums.sort!

mainasu_count = 0
index = 0
while i != 0 do
  target = true
  index = 0
  while target do
    if nums[index] >= i
      if nums[index] == i
        i -= nums[index]
        mainasu_count += 1
        target = false
        break
      end
      if index == 0
        i -= 1
        mainasu_count += 1
        target = false
      else
        i -= nums[index - 1]
        mainasu_count += 1
        target = false
      end
    else
      index += 1
    end
  end
end

p mainasu_count