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>

#define MIN(a,b) ((a) > (b) ? (b) : (a))

int N;
int main(void)
{
    int res[100001];
    int cc;
    int t;
    int i, j;
    scanf("%d", &N);

    /* 1円を入れた場合 */
    for(i=0; i<=N; i++) res[i] = i;

    /* 6^n円を入れた場合 */
    for(i=6; i<=N; i*=6){
        for(j=0; (i+j)<=N; j++) res[i+j] = MIN(res[i+j], res[j]+1);
    }

    /* 9^n円を入れた場合 */
    for(i=9; i<=N; i*=9){
        for(j=0; (i+j)<=N; j++) res[i+j] = MIN(res[i+j], res[j]+1);
    }

    printf("res : %d\n", res[N]);

    return 0;
}