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)

#define _USE_MAT_DEFINES
#include<iostream>
#include <iomanip>
#include<stdio.h>
#include<string>
#include<vector>
#include<algorithm>
#include<cmath>
#include <queue>
#include <utility>
#include <map>
#include <set>
#include <deque>
#include <numeric>
#include <functional>
using namespace std;

long long sorrow(int b,vector<int>A) {
    int value = 0;
    for (int i = 0; i < A.size(); i++)value += abs(A[i] - b);
    return value;
}

int main() {
    int N;
    cin >> N;
    vector<int>A(N);
    long long sum = 0;
    for (int i = 1; i <= N; i++) {
        cin >> A[i - 1];
        A[i - 1] -= i;
    }
    sort(A.begin(), A.end());
    long long ans;
    if (N % 2 == 0)ans = min(sorrow((A[N / 2] + A[(N / 2) + 1]) / 2, A), sorrow((A[N / 2] + A[(N / 2) + 1] + 1) / 2, A));
    else ans = sorrow(A[N / 2], A);

    cout << ans << endl;

    return 0;
}