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 main(input) {
    var n = parseInt(input, 10);

    var counter = 0;
    var a = 6;
    var b = 9;
    var tmp1 = 0;
    var tmp2 = 0;
    var tmp3 = 0;
    while(true){
    	if(n < 6) {
    		counter += n;
    		return console.log(counter);
    	}

    	for (var i = 1; i < 10000; i++) {
    		if(n - a < 0) {
    			tmp1 = a / 6;
    			break;
    		}
    		a *= 6;
    	}

    	for (var i = 1; i < 10000; i++) {
    		if(n - b < 0) {
    			tmp2 = b / 9;
    			break;
    		}
    		b *= 9;
    	}
    	//tmp1 1mp2 比較
    	tmp3 = tmp1;
    	if(tmp2 > tmp1) {
    		tmp3 = tmp2;
    	}

    	n = n - tmp3;
    	counter++;

    }

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