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 main(){
  long n,a,b,c,i,box[10000],cnt=1,dp[100000]={},max=0,j,k;
  scanf("%ld",&n);
  box[0]=1;
  for(i=6;i<=n;i*=6)
    box[cnt++]=i;
  for(i=9;i<=n;i*=9)
    box[cnt++]=i;
  dp[0]=1;
  for(i=1;i<=n;i++){
    for(j=max;j>=0;j--){
      if(dp[j]==1){
        for(k=0;k<cnt;k++){
          if(j+box[k]<=n){
            dp[j+box[k]]=1;
            if(j+box[k]>max)
              max=j+box[k];
          }
        }
      }
    }
    if(dp[n]==1){
      printf("%ld\n",i);
      return 0;
    }
  }
}