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)

n=gets.to_i
k=[1,6,36,216,1296,7776,46656,9,81,729,6561,59049]
s=Array.new(1200001,0)
for j in 1..n
  s[j]=j
end
for i in 1..11
  for j in 1..n
    s[i*n+j]=s[(i-1)*n+j]
  end
  s[i*n+k[i]]=1
  if k[i] < n then
    for j in (k[i]+1)..n
      s[i*n+j]=1+s[i*n+j-k[i]] if s[i*n+j] > 1+s[i*n+j-k[i]]
    end
  end
end
puts s[12*n]