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>
#include<stdlib.h>
#include<limits.h>

#define rep(i,begin,end) for(int i=begin; i<end; i++)

int cmpAsc(const void* a, const void* b){
    int x = *(int*)a, y = *(int*)b;
    if(x < y){
        return 1;
    }
    if(x > y){
        return -1;
    }
    return 0;
}

int main(){
    int n;
    scanf("%d", &n);
    int a[1000], len = 0;
    a[0] = 1; len++;
    int x = 6;
    while(x <= n){
        a[len++] = x;
        x *= 6;
    }
    x = 9;
    while(x <= n){
        a[len++] = x;
        x *= 9;
    }
    qsort(a, len, sizeof(int), cmpAsc);
    int t[len+1][n + 1];
    rep(i, 0, len+1){
        t[i][0] = 0;
    }
    rep(i, 1, n + 1){
        t[0][i] = 100000;
    }
    rep(i, 1, len+1){
        rep(j, 1, n + 1){
            int z = a[i-1];
            if(j < z){
                t[i][j] = t[i-1][j];
            }else{
                if(t[i][j-z] + 1 < t[i-1][j]){
                    t[i][j] = t[i][j-z] + 1;
                }else{
                    t[i][j] = t[i-1][j];
                }
            }
        }
    }
    /*rep(i, 0, len+1){
        printf("%d ", t[i][n]);
    }*/
    printf("%d", t[len][n]);

    return 0;
}