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: Wrong Answer)

#include <stdio.h>

int main()
{
	int counter, N;
	counter = 0;

	scanf("%d", &N);

	while(1)
	{
		if(N >= 59049)
		{
			N = N -59049;
			counter = counter +1;
		}
		else
		{
			break;
		}
	}
	while(1)
	{
		if(N >= 46656)
		{
			N = N -46656;
			counter = counter +1;
		}
		else
		{
			break;
		}
	}
	while(1)
	{
		if(N >= 7776)
		{
			N = N -7776;
			counter = counter +1;
		}
		else
		{
			break;
		}
	}
	while(1)
	{
		if(N >= 6561)
		{
			N = N -6561;
			counter = counter +1;
		}
		else
		{
			break;
		}
	}
	while(1)
	{
		if(N >= 1296)
		{
			N = N -1296;
			counter = counter +1;
		}
		else
		{
			break;
		}
	}
	while(1)
	{
		if(N >= 729)
		{
			N = N -729;
			counter = counter +1;
		}
		else
		{
			break;
		}
	}
	while(1)
	{
		if(N >= 216)
		{
			N = N -216;
			counter = counter +1;
		}
		else
		{
			break;
		}
	}
	while(1)
	{
		if(N >= 81)
		{
			N = N -81;
			counter = counter +1;
		}
		else
		{
			break;
		}
	}
	while(1)
	{
		if(N >= 36)
		{
			N = N -36;
			counter = counter +1;
		}
		else
		{
			break;
		}
	}
	while(1)
	{
		if(N == 14)
		{
			N = 0;
			counter = counter +4;
		}

		if(N == 13)
		{
			N = 0;
			counter = counter +3;
		}
		if(N == 12)
		{
			N = 0;
			counter = counter +2;
		}
		if(N >= 9)
		{
			N = N -9;
			counter = counter +1;
		}
		else
		{
			break;
		}
	}

	while(1)
	{
		if(N >= 6)
		{
			N = N -6;
			counter = counter +1;
		}
		else
		{
			break;
		}
	}
	while(1)
	{
		if(N >= 1)
		{
			N = N -1;
			counter = counter +1;
		}
		else
		{
			break;
		}
	}
	printf("%d", counter);
}