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
#!/bin/python

import math
import os
import random
import re
import sys

def dp(N):
    global yen
    if table.get(N) != None:
        return table.get(N)
    if N == 0:
        return 0
    if N < 0:
        return sys.maxint
    result = sys.maxint
    for i in range(len(yen)):
        result = min(result,dp(N-yen[i]))
    table[N] = 1+result
    return 1+result

def solution(N):
    return dp(N)
        
table = {}

if __name__ == '__main__':
    minVal = sys.maxint
    N = int(raw_input())
    yen = [59049,46656,7776,6561,1296,729,216,81,36,9,6,1]
    result = solution(N)

    print result