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 Fortran (gfortran v4.8.4) (judge verdict: Accepted)

program test
implicit none
integer(8) :: n,i,j,k
integer(8) :: dp(0:12,0:100000)
integer(8),parameter :: ten = 10
integer(8) :: inf = ten ** 15
integer(8) :: money(12) = (/1,6**1,6**2,6**3,6**4,6**5,6**6,9**1,9**2,9**3,9**4,9**5/)

read(*,*) n

dp(0:12,0) = 0
dp(0:12,1:100000) = inf

do i = 1,12
	do j = 1,n
		k = 1
		dp(i,j) = dp(i-1,j)
		do while (j >= money(i)*k .and. k<= 8)
			dp(i,j) = min(dp( i-1,j-(k*money(i)))+k,dp(i-1,j),dp(i,j))
			k = k + 1
		enddo
	enddo
enddo

write(*,*) dp(12,n)

end program