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.io.*;

class Main{
    static int[] dp = new int[100010];
    public static void main(String[] args) throws IOException{
        dp[0] = 0;
        int aom;
        for (int i=1;i<=100_000;i++){
            aom = 1;
            dp[i] = Integer.MAX_VALUE;
            while (aom<=i){
                dp[i] = Math.min(dp[i],dp[i-aom]+1);
                aom *= 6;
            }
            aom = 1;
            while (aom<=i){
                dp[i] = Math.min(dp[i],dp[i-aom]+1);
                aom *= 9;
            }
        }
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String str = br.readLine();
        int N = Integer.parseInt(str);
        System.out.println(dp[N]);
    }
}