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<bits/stdc++.h>

using namespace std;

int n, ans = 100000;

int power(int a, int b){
	if(b==0) return 1;
	if(b==1) return a;
	if(b%2 == 1) return power(a,b-1)*a;
	int q = power(a,b/2);
	return q*q;
}

int ss(int x){
	int p, res = 0;
	while(x > 0){
		p = 0;
		while(x - power(6, p) >= 0) p++;
		x -= power(6, p-1);
		res++;
	}
	return res;
}

int nn(int x){
	int p, res = 0;
	while(x > 0){
		p = 0;
		while(x - power(9, p) >= 0) p++;
		x -= power(9, p-1);
		res++;
	}
	return res;
}

int main(){
	cin >> n;
	for(int six = 0; six <= n; ++six){
		int nine = n-six;
		ans = min(ans, ss(six)+nn(nine));
	}
	cout << ans << endl;
}