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
import java.util.*;

public class Main{
    public static void main(String[] args){
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int ret = n;

        for (int i=0;i<=n;i++){
            int g1 = i;
            int g2 = n-i;
            int check = 0;
            int a1 = 0;
            int a2 = 0;
            while (g1 > 0){
                int remain = g1%6;
                g1 -= remain;
                a1 += remain;
                g1 = (int) g1/6;
            }

            while (g2 > 0){
                int remain = g2%9;
                g2 -= remain;
                a2 += remain;
                g2 = (int) g2/9;
            }
            check = a1+a2;
            if (check < ret){
                ret = check;
            }
        }
        System.out.println(ret);
    }
    
}