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: Runtime Error)

#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;

const ll INF = 1LL << 60;

ll N;
ll dp[100100];

int main() {
    cin >> N;
    vector<ll> v;
    v.push_back(1);

    int tmp = 6;
    while (tmp < N) {
        v.push_back(tmp);
        tmp *= 6;
    }

    tmp = 9;
    while (tmp < N) {
        v.push_back(tmp);
        tmp *= 9;
    }

    sort(v.begin(), v.end());
    rep(i, 100100) dp[i] = INF;

    dp[0] = 0;
    rep(i, v.size()) {
        for (int j = v[i]; j <= 10 * N; j++) {
            dp[j] = min(dp[j], dp[j - v[i]] + 1);
        }
    }
    cout << dp[N] << endl;
    // rep(i, v.size()) {
    //     cout << v[i] << " ";
    // }

}