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
def smaller(x, y):
	if x < y: return x
	return y

nine = []
six = []
a = 9
while a <= 100000:
	nine.append(a)
	a *= 9
a = 6
while a <= 100000:
	six.append(a)
	a *= 6

dp = [0]
for i in range(1, 100001):
	min = dp[i-1]+1
	for j in range(0, len(nine)):
		if i < nine[j]: break
		min = smaller(min, dp[i-nine[j]]+1)
	for j in range(0, len(six)):
		if i < six[j]: break
		min = smaller(min, dp[i-six[j]]+1)
	dp.append(min)
print dp[int(raw_input())]