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 Go (1.6) (judge verdict: Accepted)

///
// File:  c.go
// Author: ymiyamoto
//
// Created on Sun Jun 10 21:06:08 2018
//
package main

import (
	"fmt"
	"sort"
)

var N int

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

func pow(a, b int) int {
	ans := 1
	for i := 0; i < b; i++ {
		ans *= a
	}
	return ans
}

func main() {
	fmt.Scan(&N)

	arr := []int{1, pow(6, 1), pow(6, 2), pow(6, 3), pow(6, 4), pow(6, 5), pow(6, 6), pow(6, 7), pow(9, 1), pow(9, 2), pow(9, 3), pow(9, 4), pow(9, 5), pow(9, 6)}
	sort.Ints(arr)

	dp := make([]int, N+1)
	for i := range dp {
		dp[i] = 1 << 30
	}
	dp[0] = 0
	for i := range dp {
		for j := range arr {
			if i-arr[j] >= 0 {
				dp[i] = min(dp[i], dp[i-arr[j]]+1)
			}
		}
	}

	fmt.Println(dp[N])
}