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
N=int(raw_input())
M=[999999 for i in range(N+1)]
possible=sorted([1]+[6**i for i in range(1,100) if 6**i<=N]+[9**i for i in range(1,100) if 9**i<=N])
M[0]=0
for p in possible:
    M[p]=1

for m in range(N+1):
    tmp=999999
    for p in possible:
        if m-p>0:
            tmp=min(tmp, M[m-p]+1)

    M[m]=min(tmp,M[m])

print M[N]
