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: Accepted)

#include<cstdio>
#include<iostream>
using namespace std;
const int MAXN=8;
const int INF=100000;
int n;
int six[MAXN],nin[MAXN];
int dp[INF+1];
int main(){
	scanf("%d",&n);
	six[0]=nin[0]=1;
	for(int i=1;i<MAXN;++i){
		six[i]=six[i-1]*6;
		nin[i]=nin[i-1]*9;
	}
	for(int i=1;i<=n;++i){
		dp[i]=i;
		for(int j=0;j<MAXN;++j){
			if(six[j]>i) break;
			dp[i]=min(dp[i],dp[i-six[j]]+1);
		}
		for(int j=1;j<MAXN;++j){
			if(nin[j]>i) break;
			dp[i]=min(dp[i],dp[i-nin[j]]+1);
		}
	}
	printf("%d",dp[n]);
	return 0;
}