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 Map<Integer,Integer> dp = new HashMap<>();
    static List<Integer> depos = new ArrayList<>();

    static void doDepo(int n){
        List<Integer> ans = new ArrayList();
        for(int v : depos){
            if(n == v){
                dp.put(n,1);
                return;
            }else if(n > v){
                ans.add(dp.get(n-v) + 1);
            }
        }
        int result = ans.stream().min((a, b) -> a.compareTo(b)).get();
        dp.put(n,result);
    }

    public static void main(String args[]) {
        Scanner sc = new Scanner(System.in);
        int v = sc.nextInt();

        // 引出可能金額準備
        depos.add(1);
        int d = 6;
        while(d <= 100000){
            depos.add(d);
            d = d * 6;
        }
        d = 9;
        while(d <= 100000){
            depos.add(d);
            d = d * 9;
        }
        // dp準備
        for(int i = 1; i <= 100000; i++){
            doDepo(i);
        }
        // 回答
        System.out.println(dp.get(v));
    }
}