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: Runtime Error)



import java.util.*;
import java.util.stream.Collectors;


public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        final int N=scanner.nextInt();
        int[] count=new int[N+1];
        int[] sample={0,1,2,3,4,5,1,2,3,1};
        for(int i=0;i<10;i++){
            count[i]=sample[i];
        }
        for(int i=10;i<=N;i++){
            int minNum=Integer.MAX_VALUE;
            int j=0;
            while(i>Math.pow(6,j)){
                if(minNum>count[i-(int)Math.pow(6,j)]){
                    minNum=count[i-(int)Math.pow(6,j)]+1;
                }
                j++;
            }
            j=0;
            while(i>Math.pow(9,j)){
                if(minNum>count[i-(int)Math.pow(9,j)]){
                    minNum=count[i-(int)Math.pow(9,j)]+1;
                }
                j++;
            }
            count[i]=minNum;
        }
        System.out.println(count[N]);

    }
}