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.*;
public class Main {
	static Scanner sc = new Scanner(System.in);
	static int[] coin = new int[100001];
	public static void main(String[] args) {
		maketable();
		int N = sc.nextInt();
		System.out.println(coin[N]);
	}
	static void maketable() {
		int i,k;
		for(i = 0;i <= 100000;i ++) {
			coin[i] = i;
		}
		int s = 6,n = 9;
		while(s <= 100000 || n <= 100000) {
			for(k = s;k <= 100000;k++) {
				if(coin[k] > coin[k-s]+1) coin[k] = coin[k-s] + 1;
			}
			for(k = n;k <= 100000;k++) {
				if(coin[k] > coin[k-n]+1) coin[k] = coin[k-n] + 1;
			}
			s = s * 6; n = n * 9;
		}
	}
}