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 {
    static int max = 100000;
    
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        function(n);
    }
    
    private static void function(int n) {
        int [] count = new int [max+1];
        for(int i = 0; i < count.length; i++) {
            count[i] = i;
        }
        List<Integer> list = new ArrayList<>();
        multiply(list,6);
        multiply(list,9);
        
        for(int i = 0; i < count.length; i++) {
            for(int j = 0; j < list.size(); j++) {
                int tmp = list.get(j);
                if(i+tmp <= max) {
                    count[i+tmp] = Math.min(count[i+tmp], count[i]+1);
                }
            }
        }
        System.out.println(count[n]);
    }
    
    private static void multiply(List<Integer> list, int num) {
        int x = num;
        while(x <= max) {
            list.add(x);
            x *= num;
        }
    }
}