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.Scanner;
import java.util.ArrayList;
import java.util.List;
import java.util.Collections;
import java.util.Arrays;
public class Main{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        List<Integer> list = new ArrayList<>();
        list.add(1);
        int nine = 9;
        for(int i = 0;i < 6;i++){
            list.add(nine);
            nine *= 9;
        }
        int six = 6;
        for(int i = 0;i < 6;i++){
            list.add(six);
            six *= 6;
        }
        Collections.sort(list);
        int[] dp = new int[n+1];
        for(int i = 1;i <= n;i++){
            dp[i] = 1000000000;
        }
        for(int i = 1;i <= n;i++){
            for(Integer v : list){
                if(v > i){
                    continue;
                }
                dp[i] = Math.min(dp[i],dp[i-v]+1);
            }
        }
        System.out.println(dp[n]);

    }
    public static int sub(int n,List<Integer> x){
        int i = x.size();
        if(n <= 0){
            return 0;
        }
        while(n-x.get(i-1) < 0){
            i--;
        }
        return i-1;
    }
}
