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 min = 100000;

void DIV6(int, int);

void DIV9(int N, int num)  
{
    int R = 0, times = 0;
    
    if(N < 9)
        DIV6(N, num);
    else
    {
        while(N >= 9)
        {
            R += pow(9, times)*(N%9);
            N /= 9;
            times++;
        }
        DIV9(R, num+N);
        DIV6(R, num+N);
    }
}
void DIV6(int N, int num)   
{
    int R = 0, times = 0;
  
    if(N < 6)
    {
        if(min > num+N)
            min = num+N;
    }
    else
    {    
        while(N >= 6)
        {
            R += pow(6, times)*(N%6);
            N /= 6;
            times++;
        }
        DIV9(R, num+N);
        DIV6(R, num+N);
    }
}

int main(void)
{
    int N;
  
    scanf("%d", &N);
    
    DIV9(N, 0);
    DIV6(N, 0);
    
    printf("%d\n", min);

    system("pause");
    return 0;
}