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.

Examples

Input

127


Output

4


Input

3


Output

3


Input

44852


Output

16
'''input
44852
'''
cur6 = [6]
cur9 = [9]
cur1 = [1]
for i in range(7):
	cur6.append(6*cur6[-1])
	cur9.append(9*cur9[-1])
n = input()
dp = [-1]*(n+1)
dp[0] = 0
dp[1] = 1
for i in range(7):
	if cur6[i] <= n:
		dp[cur6[i]] = 1
	if cur9[i] <= n:
		dp[cur9[i]] = 1
for i in range(2,n+1):
	if dp[i] == 1:
		continue
	else:
		# currency 1
		dp[i] = dp[i-1]+1
		# currency 6,9
		for j in range(7):
			if i-cur6[j] >= 0:
				dp[i] = min(dp[i],dp[i-cur6[j]]+1)
			if i-cur9[j] >= 0:
				dp[i] = min(dp[i],dp[i-cur9[j]]+1)
print dp[n]