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 <bits/stdc++.h>
using namespace std;
 
#define rep for(int i = 0;i<n;i++)
const int MOD = 1000000007;
 
int main(){
    int n;cin >> n;
    vector<int>s = {1};
    int i  = 1;
    while(pow(6,i)<=n){
        s.push_back(pow(6,i));
        i++;
    }
    i = 1;
    while(pow(9,i)<=n){
        s.push_back(pow(9,i));
        i++;
    }
    int ans = n;
    sort(s.begin(),s.end());
    for(int i = 1;i<=pow(2,s.size());i++){
        int a = n; int sum = 0;
        for(int j = s.size()-1;j>=0;j--){
            int k = i;
            if((k>>j)%2 == 1){
                sum += a/s[j];
                a = a%s[j];
            }
        }
        ans = min(ans,sum+a);
    }
    cout << ans << endl;
}