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.*;

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

    int N = in.nextInt();
    Set<Integer> set = new HashSet<Integer>();
    set.add(1);

    int six = 6;
    while (six <= N) {
      set.add(six);
      six *= 6;
    }

    int nine = 9;
    while (nine <= N) {
      set.add(nine);
      nine *= 9;
    }

    int[] nums = new int[N + 1];

    for (int i = 1; i <= N; i++) {
      for (Integer n : set) {
        if (n <= i) {
          if (nums[i] == 0) {
            nums[i] = nums[i - n] + 1;
          } else {
            nums[i] = Math.min(nums[i], nums[i - n] + 1);
          }
        }
      }
    }

    System.out.println(nums[N]);
  }
}