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 "iostream"
# include "cstdio"
# include "cstring" 

using namespace std;

const int maxm=100000+10;
int f[maxm],n;
int thing[maxm],tot; 

int main(){
	thing[++tot]=1;
	register int i,j;
	memset(f,0x3f,sizeof(f)); 
	scanf("%d",&n); 
	i=6; 
	while(i<=n){
		thing[++tot]=i;
		i*=6; 
	}
	i=9; 
	while(i<=n){
		thing[++tot]=i;
		i*=9; 
	}
	f[0]=0; 
	for(i=1;i<=tot;i++){
		for(j=thing[i];j<=n;j++){
			f[j]=min(f[j],f[j-thing[i]]+1); 
		} 
	}
	printf("%d",f[n]); 
	return 0; 
}