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++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n;
    int _9[10],_6[10];
    _9[0]=0;_6[0]=0;_9[1]=9;_6[1]=6;
    for(int i=2;i<10;i++)
    {
        _9[i]=_9[i-1]*9;
        _6[i]=_6[i-1]*6;
    }
    while(~scanf("%d",&n))
    {
        int sum=0,a,b;
        while(n>=18)
        {
            for(int i=8;i>0;i--)
            {
                if(n>_9[i])
                {
                     a=i;
                     break;
                }
            }
            for(int i=8;i>0;i--)
            {
                if(n>_6[i])
                {
                     b=i;
                     break;
                }
            }
            a=_9[a]>_6[b]?_9[a]:_6[b];
            n=n-a;
            sum++;
        }
        if(n>=12)
            sum=n-12+2+sum;
        else if(n>=9)
            sum=n-9+1+sum;
        else if(n>=6)
            sum=n-6+1+sum;
        else
            sum=sum+n;
        printf("%d\n",sum);
    }
}