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: Wrong Answer)

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {

		Scanner sc=new Scanner(System.in);

		int N=sc.nextInt();

		int[] dp=new int[N+1];
		int INF=100001;

		for(int i=0;i<N+1;i++) dp[i]=INF;

		dp[0]=0;

		int n6=6;
		int n9=9;

		double cnt6=2.0;
		double cnt9=2.0;

		for(int i=1;i<N+1;i++) {

			dp[i]=Math.min(dp[i], dp[i-1]+1);

			if(i>Math.pow(6, cnt6)) {
				n6=(int)Math.pow(6, cnt6);
				cnt6++;
			}

			if(i==Math.pow(9, cnt9)) {
				n9=(int)Math.pow(9, cnt9);
				cnt9++;
			}

			if(i>6)	dp[i]=Math.min(dp[i], dp[i-n6]+1);
			if(i>9) dp[i]=Math.min(dp[i], dp[i-n9]+1);


			//System.out.println(i+" "+dp[i]);
		}

		System.out.println(dp[N]);

		sc.close();
	}
}