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(void) {

  int n;
	scanf("%d", &n);
	int withdraw9, withdraw6, withdraw;
	int bit[10];
	int min = -1;
	for (int i = 0; i*9 <= n; i++) {
		withdraw = 0;
		withdraw9 = i*9;
		for (int i = 0; i < 10; i++) {
			bit[i] = 0;
		}
		bit[0] = withdraw9;
		for (int i = 1; i < 10; i++) {
			bit[i] += bit[i-1]/9;
			bit[i-1] %= 9;
		}
		for (int i = 0; i < 10; i++) {
			withdraw += bit[i];
		}
		withdraw6 = n-withdraw9;
		for (int i = 0; i < 10; i++) {
			bit[i] = 0;
		}
		bit[0] = withdraw6;
		for (int i = 1; i < 10; i++) {
			bit[i] += bit[i-1]/6;
			bit[i-1] %= 6;
		}
		for (int i = 0; i < 10; i++) {
			withdraw += bit[i];
		}
		if (min == -1 || withdraw < min) {
			min = withdraw;
		}
	}
	printf("%d\n", min);

  return 0;
}