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 Java8 (OpenJDK 1.8.0) (judge verdict: Accepted)

import java.util.*;
import static java.lang.System.*;
import static java.lang.Math.*;
public class Main {
    public static void main(String[] $) {
        Scanner sc = new Scanner(in);
        int n = sc.nextInt();
        int ans=Integer.MAX_VALUE;
        int s1=n/6,s2=n/9;
        int[] TS=new int[n+10];
        int[] TN=new int[n+10];
        for (int i = 0; i <= n; i+=6) {
            int temp=i;
            while (temp/6>0){
                temp/=6;
                TS[i]+=temp%6;
            }
            for (int j = 0; j < 6; j++) {
                if(i+j<=n)TS[i+j]=TS[i]+j;
            }
        }
        for (int i = 0; i <= n; i+=9) {
            int temp=i;
            while (temp/9>0){
                temp/=9;
                TN[i]+=temp%9;
            }
            for (int j = 0; j < 9; j++) {
                if(i+j<=n)TN[i+j]=TN[i]+j;
            }
        }
        for (int i = 0; i <= s1; i++) {
            for (int j = 0; j <= s2; j++) {
                int six=6*i;
                int nine=9*j;
                if(i*6+j*9<=n){
                    ans=min(ans,TS[i*6]+TN[j*9]+n-6*i-9*j);
                }
            }
        }
        out.println(ans);
    }
}