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 java.util.Map.Entry;
	 
	 
	 class Main {
		 static int mod =  (int) (Math.pow(10,9)+7);
		 static List<ArrayList<Integer>>  list = new ArrayList<ArrayList<Integer>>();
	    public static void main(String[] args) {
	    	
	        Scanner sc = new Scanner(System.in);
	        int N = sc.nextInt();	
	        long[] m = new long[12];
	        m[0]=1;
	        int k=1;
	        for(int i=6;i<100005;i=i*6) {
	        	m[k]=i;
	        	k++;
	        }
	        for(int i=9;i<100005;i=i*9) {
	        	m[k]=i;
	        	k++;
	        }
	        Arrays.sort(m);
	        int[] ans = new int[100005];
	        ans[0]=0;
	        for(int i=1;i<100002;i++) {
	        	long min=100005;
	        	for(int j=0;j<12&&m[j]<=i;j++) {
	        		min = Math.min(min, ans[(int) (i-m[j])]+1);
	        	}
	        	ans[i]=(int) min;
	        }
	        
	        
	        System.out.println(ans[N]);
	        
	    }
	}