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 read():
    return raw_input()


def write(message):
    import sys
    print message
    sys.stdout.flush()


if __name__ == '__main__':
    n = int(read())

    allowed = [1, ]
    spow = 6
    while spow <= n:
        allowed.append(spow)
        spow *= 6
    npow = 9
    while npow <= n:
        allowed.append(npow)
        npow *= 9

    allowed = allowed[::-1]
    res = {a: 1 for a in allowed}

    def min_ops(N):
        global res
        global allowed
        if N in res:
            return res[N]

        for a in allowed:
            if N - a > 0:
                if N not in res or min_ops(N-a) + 1 < res[N]:
                    res[N] = min_ops(N-a) + 1
        return res[N]

    write(min_ops(n))





