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: Wrong Answer)

#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
  int n;
  cin >> n;
  vector<int> list;
  list.push_back(1);
  int pbn = 0;
  int i;
  for (i = 0; pow(6, i) < n; i++) {
    list.push_back(pow(6, i));
  }
  for (i = 0; pow(9, i) < n; i++) {
    list.push_back(pow(9, i));
  }
  sort(list.begin(), list.end());
  list.erase(unique(list.begin(), list.end()), list.end());
  int list_index = 0;
  int result = 0;
  sort(list.begin(), list.end(), greater<int>());
  while (n != 0) {
    if (list[list_index] <= n) {
      result++;
      n -= list[list_index];
    } else {
      list_index++;
    }
  }
  cout << result << endl;
  return 0;
}