#include <bits/stdc++.h>
using namespace std;

int main() {
  int n;
  cin >> n;

  int ans = n;
  for (int i = 0; i <= n; i ++) {
    int cc = 0, t = i;
    while (t > 0) {
      cc += t % 6;
      t /= 6;
    }
    t = n - i;
    while (t > 0) {
      cc += t % 9;
      t /= 9;
    }
    if (ans > cc) ans = cc;
  }

  cout << ans << endl;
}

### Prompt

Please formulate a Cpp solution to the following problem:

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.

Examples

Input

127


Output

4


Input

3


Output

3


Input

44852


Output

16

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;

int main() {
  int n;
  cin >> n;

  int ans = n;
  for (int i = 0; i <= n; i ++) {
    int cc = 0, t = i;
    while (t > 0) {
      cc += t % 6;
      t /= 6;
    }
    t = n - i;
    while (t > 0) {
      cc += t % 9;
      t /= 9;
    }
    if (ans > cc) ans = cc;
  }

  cout << ans << endl;
}

```