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.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;

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

        List<Integer> nums = new ArrayList<>();
        nums.add(1);

        for (int i = 6; i <= 100000; i *= 6) {
            nums.add(i);
        }

        for (int i = 9; i <= 100000; i *= 9) {
            nums.add(i);
        }
        
        int[] steps = new int[100001];
        Arrays.fill(steps, Integer.MAX_VALUE);
        steps[0] = 0;
        for (int i = 0; i < steps.length - 1; i++) {
            for (int num : nums) {
                if (i + num <= 100000) {
                    steps[i + num] = Math.min(steps[i] + 1, steps[i + num]);
                }
            }
        }

        System.out.println(steps[n]);
    }
}