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 C (GCC 5.4.1) (judge verdict: Accepted)

#include <stdio.h>
int SIX[]  = {6*6*6*6*6*6, 6*6*6*6*6, 6*6*6*6, 6*6*6, 6*6, 6};
int NINE[] = {9*9*9*9*9, 9*9*9*9, 9*9*9, 9*9, 9};
static int memo[100000];
	     
int search(int n) {
  if(n == 0) return 0;
  if(memo[n] != 0) return memo[n];

  int ret0 = n;
  for(int i = 0; i < 6; i++) {
    if(n >= SIX[i]) {
      ret0 = search(n - SIX[i]) + 1;
      break;
    }
  }
  int ret1 = n;
  for(int i = 0; i < 5; i++) {
    if(n >= NINE[i]) {
      ret1 = search(n - NINE[i]) + 1;
      break;
    }
  }
  int ret = (ret0 < ret1) ? ret0 : ret1;
  memo[n] = ret;
  return ret;
}

int main(void) {
  int N;
  scanf("%d", &N);

  int Ans = search(N);
  printf("%d\n", Ans);
  return 0;
}