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>
int MIN(int a,int b){return a<b?a:b;}
int main(){
  int m,i,j,k,l,s[100010],n[100010],d[300010]={1,1};
  s[0]=n[0]=1;
  scanf("%d",&m);
  for(i=2;i<100010;i++)d[i]=1e9;
  for(j=0;s[j]<100000;j++)s[j+1]=s[j]*6;
  for(k=0;n[k]<100000;k++)n[k+1]=n[k]*9;
  //printf("%d %d\n",s[j-1],n[k-1]);
  for(i=1;i<=m;i++){
    d[i+1]=MIN(d[i+1],d[i]+1);
    for(l=0;l<j;l++)d[i+s[l]]=MIN(d[i+s[l]],d[i]+1);
    for(l=0;l<k;l++)d[i+n[l]]=MIN(d[i+n[l]],d[i]+1);
  }
  printf("%d\n",d[m]);
  return 0;
}