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 K9, K6;

int DIV9(int N)  
{
    int R = 0, times = 0;
    
    while(N >= 9)
    {
        R += pow(9, times)*(N%9);
        N /= 9;
        times++;
    }
    K9 = N;
    
    //printf("K9: %d\n", N);
    
    return R;
}
int DIV6(int N)   
{
    int R = 0, times = 0;
  
    while(N >= 6)
    {
        R += pow(6, times)*(N%6);
        N /= 6;
        times++;
    }
    K6 = N;
    
    //printf("K6: %d\n", N);
    
    return R;
}
int main(void)
{
    int N, N6, N9;
    int times = 0;
  
    scanf("%d", &N);
    
    while(N >= 6)
    {
        N9 = DIV9(N);
        N6 = DIV6(N);
       
       if(K9 <= K6)
           N = N9;
       else
           N = N6;
       
       times++;
    }
    
    //printf("%d\n", times);
    /**/printf("%d\n", times+N);

    //system("pause");
    return 0;
}