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 sc = new Scanner(System.in);
        int n = sc.nextInt();
        int dp[] = new int[n+1];
        Arrays.fill(dp,Integer.MAX_VALUE-1);
        dp[0] = 0;
        HashSet<Integer> set = new HashSet<>();
        set.add(1);
        int num = 1;
        while(num <= n){
            num *= 6;
            set.add(num);
        }
        num = 1;
        while(num <= n){
            num *= 9;
            set.add(num);
        }

        for(Integer val : set){
            for(int i = val; i < dp.length ; i++){
                dp[i] = Math.min(dp[i],1+dp[i-val]);
            }
        }
        System.out.println(dp[n]);
    }
}