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: Wrong Answer)

n = gets.chomp.to_i
ans = 0
n0 = n/3
ans = n

def f(n,base)
  return n.to_s(base).split("").inject(0){|result,item| result += item.to_i}
end

x0,y0 =0,0

(0..n/2).each{|i|
  (0..n/3).each{|j|
    if 2*i+3*j ==n0 then
      x0,y0 = i,j
      break
    end
  }
      break if (x0>0 or y0>0)
    }

x,y = 0,0
pair =[]
(0..n).each{|k|
    x,y = x0+3*k, y0-2*k
    break if y<0
    n1 = f(x,6)
    n2 = f(y,9)
    ans = n1+n2  if n1+n2 <ans
}

ans += n%3
puts ans