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.Scanner;

public class Main {
    public static int nowMin = Integer.MAX_VALUE;
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        search(n,0,n);
        System.out.println(nowMin);
    }

    public static void search(int n,int c,int last){
        if(n == 0){
            if(nowMin > c)nowMin = c;
            return;
        }
        else if(n < 0||nowMin < c)return;
        int n9 = 0;
        int n6 = 0;
        for (int i = 1;Math.pow(9,i) <= last;++i){
            n9 = i;
        }
        for (int i = 1;Math.pow(6,i) <= last;++i){
            n6 = i;
        }
        for (int i = n9;i >= 1;--i){
            search(n - (int)Math.pow(9,i),c + 1,(int)Math.pow(9,i));
        }
        for (int i = n6;i >= 1;--i){
            search(n - (int)Math.pow(6,i),c + 1,(int)Math.pow(6,i));
        }
        int mm = c + n;
        if(nowMin > mm)nowMin = mm;
    }
}