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 pb push_back
#define ll long long
#define mp make_pair
#define ss second
#define ff first

vector<int> coi;

int dp[100007];

int solve(int n)
{
	if(n==0)
	return 0;
	
	if(dp[n]!=-1)
		return dp[n];

	int temp=INT_MAX;
	for(int i=0;i<coi.size();i++)
	{
		if(coi[i]<=n)
		{
			temp=min(temp,1+solve(n-coi[i]));
		}
	}
	dp[n]=temp;
	return temp;
}

int main() 
{
	memset(dp,-1,sizeof(dp[0])*100007);
	coi.pb(1);
	int p6=6;
	int p9=9;
	while(p6<=100000)
	{
		coi.pb(p6);
		p6*=6;
	}
	while(p9<=100000)
	{
		coi.pb(p9);
		p9*=6;
	}

	int n;
	cin>>n;
	cout<<solve(n)<<endl;

	return 0;
}