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: Accepted)

'use strict';
console.log(function(args){
  const N = args.trim()|0;
  const dp = Array(N+1).fill(Infinity);
  dp[0] = 0;
  for ( let i = 0; i < N; i++ ) {
    if ( dp[i] < dp[i+1] ) dp[i+1] = dp[i] + 1;
    for ( let j = 6; i+j <= N; j*=6 ) {
      if ( dp[i] < dp[i+j] ) dp[i+j] = dp[i] + 1;
    }
    for ( let j = 9; i+j <= N; j*=9 ) {
      if ( dp[i] < dp[i+j] ) dp[i+j] = dp[i] + 1;
    }
  }
  return dp[N].toString();
}(require('fs').readFileSync('/dev/stdin', 'utf8')));