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 C++14 (GCC 5.4.1) (judge verdict: Accepted)

#include<iostream>

using namespace std;

const static int MAX_N = 100000;

int N;

int rec(int price, int cnt) {
  if (price < 6) {
    return cnt + price;
  } 

  int value_nine = 9;
  while (price >= value_nine) {
    value_nine *= 9;
  }
  value_nine /= 9;
  int value_six = 6;
  while (price >= value_six) {
    value_six *= 6;
  }
  value_six /= 6;

  if (price >= 6 && price < 0) {
    return rec(price - value_six, cnt + 1);
  } else {
    return min(rec(price - value_nine, cnt + 1), rec(price - value_six, cnt + 1));
  }
}

int main() {
  cin >> N;

  int ans = rec(N, 0);

  cout << ans << endl;
  return 0;
}