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: Wrong Answer)

#include <stdio.h>
#include <math.h>

int num[100001];

int Func(int n){
  if(num[n]>=0) return num[n];
  int min = 100000;
  int temp;
  for(int i = 1; pow(6,i) <= n; i++){
    temp = Func(n-pow(6, i));
    if(min > temp) min = temp;
  }
  for(int i = 1; pow(9,i) <= n; i++){
    temp = Func(n-pow(9, i));
    if(min > temp) min = temp;
  }
  num[n] = min + 1;
  return num[n];
}

int main(int argc, char const *argv[]){
  int n;
  num[0]=0;
  num[1]=1;
  num[2]=2;
  num[3]=3;
  num[4]=4;
  num[5]=5;
  for(int i = 6; i<100000;i++){
    num[i]=-1;
  }
  scanf("%d", &n);
  printf("%d", Func(n));
  return 0;
}