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;

class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int N = scanner.nextInt();

        int sum_num = 0;
        int i9 = 0;
        while (Math.pow(9, i9 + 1) < N) {
            i9++;
        }

        int i6 = 0;
        while (Math.pow(6, i6 + 1) < N) {
            i6++;
        }

        for (int i = i9; i > 0; i--) {
            for (int j = i6; j  > 0; j--) {
                int pow9 = (int) Math.pow(9, i);
                int pow6 = (int) Math.pow(6, j);
                if (pow9 > pow6 && pow9 < N) {
                    N = N - pow9;
                    sum_num++;
                }
                if (pow6 > pow9 && pow6 < N) {
                    N = N - pow6;
                    sum_num++;
                }
            }
        }
        sum_num += N;

        System.out.println(sum_num);
    }
}