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 PHP7 (7.0.15) (judge verdict: Accepted)

<?php
// C
fscanf(STDIN, '%d', $n);
if ($n < 6) exit(strval($n));
$n6 = 6;
$n9 = 9;
while (true) {
    if ($n6 > $n && $n9 > $n) break;
    if ($n6 <= $n) {
        $a6[] = $n6;
        $n6 *= 6;
    }
    if ($n9 <= $n) {
        $a9[] = $n9;
        $n9 *= 9;
    }
}
rsort($a6);
rsort($a9);
$ans = PHP_INT_MAX;
for ($i = 0; $i <= $n; $i++) {
    $cnt = 0;
    $t = $i;
    foreach ($a6 as $v) {
        $cnt += intdiv($t, $v);
        $t %= $v;
    }
    $cnt += $t;
    $t = $n - $i;
    foreach ($a9 as $v) {
        $cnt += intdiv($t, $v);
        $t %= $v;
    }
    $cnt += $t;
    $ans = min($ans, $cnt);
}
echo $ans;