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 JavaScript (node.js v5.12) (judge verdict: Wrong Answer)

function count_price(count, price){
  if(price==0){return count;}
  const numbers = array_of_6_9();
  for(var i=0;i<numbers.length;i++){
    if(numbers[i]<=price){
//console.log(numbers[i]);
return count_price(count+1, price-numbers[i])}
  }
}

function array_of_6_9(){
  var arr_6 = [];
  var tmp = 1;
  for(var i=0;i<6;i++){
    tmp*=6;
    arr_6.push(tmp)
  }

  var arr_9 = [];
  var tmp = 1;
  for(var i=0;i<5;i++){
    tmp*=9;
    arr_9.push(tmp)
  }
  var result = [1];
  result = result.concat(arr_6);
  result = result.concat(arr_9);

  result.sort(function(a,b){return b-a;})

  return result;
}

function main(input){
  const lines = input.split('\n');
  const N = parseInt(lines[0]);

  times_6_9_numbers = array_of_6_9();
  var result = count_price(0, N);
  console.log(result);
}

main(require('fs').readFileSync('/dev/stdin', 'utf8'));