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 (GCC 5.4.1) (judge verdict: Accepted)

#include<stdio.h>

int main(){
	int i,j,min,N,ans=0,memo[100001]={0};
	scanf("%d",&N);

	for(i=1;i<=N;i++){
		min=memo[i-1];
		if(i>=6 && min>memo[i-6])min=memo[i-6];
		if(i>=9 && min>memo[i-9])min=memo[i-9];
		if(i>=36 && min>memo[i-36])min=memo[i-36];
		if(i>=81 && min>memo[i-81])min=memo[i-81];
		if(i>=216 && min>memo[i-216])min=memo[i-216];
		if(i>=729 && min>memo[i-729])min=memo[i-729];
		if(i>=1296 && min>memo[i-1296])min=memo[i-1296];
		if(i>=6561 && min>memo[i-6561])min=memo[i-6561];
		if(i>=7776 && min>memo[i-7776])min=memo[i-7776];
		if(i>=46656 && min>memo[i-46656])min=memo[i-46656];
		if(i>=59049 && min>memo[i-59049])min=memo[i-59049];

		memo[i]=min+1;
	}

	printf("%d\n",memo[N]);
	return 0;
}