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 A=sc.nextInt();
		int nine=0;
		int cntsix=10000;
		int cnt=0;
		int cntnine=10000;
		double tmp=A;
		int i=1;
		int j=9;
		while(true) {
			if(Math.pow(9,i)>tmp&&i<=cntnine&&i!=1&&tmp>81) {
			if(Math.pow(6,i)<tmp) {tmp-=Math.pow(6, i);cnt++;cntnine=i;
			//System.out.println("6pow:i="+i);
			i=1;}
			else {
				tmp-=Math.pow(9, i-1);cnt++;
			//System.out.println("9:"+(i-1));
			//System.out.println(tmp);
			cntnine=i;i=1;
			}

			}
			else if(Math.pow(6,i)>tmp&&i<=cntsix&&i!=1&&tmp>=36) {tmp-=Math.pow(6, i-1);cnt++;
			//System.out.println("6:"+tmp);
			cntsix=i;i=1;
			}
			else {i++;}
			if(tmp<36) {break;}
		}
		while(true) {
			if(tmp>=9*j) {tmp-=9;cnt++;}
			else if(tmp>=6*j) {tmp-=6;cnt++;}
			if(tmp<6) {break;}
			j--;
		}
		int c=(int)tmp;
			System.out.println(cnt+c);
			//System.out.println(tmp);
	}
	}