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.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;

public class Main {

    public static void main(String[] args) throws Exception {
        InputStreamReader is = new InputStreamReader(System.in);
        BufferedReader reader = new BufferedReader(is);

        List<String> mylist = new ArrayList<>();

        // 標準入力からの値を変数strinputに代入
        String strinput = reader.readLine();

        while (strinput != null) {

            mylist.add(strinput);
            strinput = reader.readLine();

        }

        int n = Integer.valueOf(mylist.get(0));

        int i = 1;

        int cnt = 0;
        cnt = countup(n, i, cnt);

    }

    public static int countup(int n, int i, int cnt) {

        if (n == 0) {
            System.out.println(cnt);
        } else {

            if (n >= Math.pow(9, i) || n >= Math.pow(6, i)) {
                countup(n, i + 1, cnt);

            } else {

                int amari1 = n % (int) Math.pow(9, i - 1);
                int amari2 = n % (int) Math.pow(6, i - 1);

                //                System.out.println(amari1 + " " + amari2);

                if (amari1 <= amari2) {

                    //                    System.out
                    //                            .println("9=" + cnt + " " + n + " " + Math.pow(9, i - 1) + " " + (n - Math.pow(9, i - 1)));
                    n -= Math.pow(9, i - 1);

                    cnt += 1;

                    countup(n, 1, cnt);
                } else if (n >= Math.pow(6, i - 1)) {

                    //                    System.out
                    //                            .println("6=" + cnt + " " + n + " " + Math.pow(6, i - 1) + " " + (n - Math.pow(6, i - 1)));
                    n -= Math.pow(6, i - 1);
                    cnt += 1;

                    countup(n, 1, cnt);

                }
            }
        }

        return cnt;

    }

}