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;

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

    int min = N;
    for (int A = 0; A <= N; A++) {
      int x = 0;

      int i = A;
      int j = 6;
      while (i >= j) {
        int k = (i / j) % 6;
        i -= j * k;
        x += k;
        j *= 6;
      }

      i = (N - A) + i;
      j = 9;
      while (i >= j) {
        int k = (i / j) % 9;
        i -= j * k;
        x += k;
        j *= 9;
      }
      x += i;
      if (min > x) {
        min = x;
      }
    }
    System.out.println(min);
  }
}
