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();
    ArrayList<Integer> kingaku = new ArrayList<Integer>();
    kingaku.add(1);
    for(int i = 1; i < 100; i++) {
      int a = (int)Math.pow(6, i);
      if(a > 100000) break;
      kingaku.add(a);
    }
    for(int i = 1; i < 100; i++) {
      int b = (int)Math.pow(9, i);
      if(b > 100000) break;
      kingaku.add(b);
    }
    Collections.sort(kingaku);
    int[] dp = new int[n + 1];
    dp[1] = 1;
    for(int i = 2; i <= n; i++) {
      int t = i;
      for(int j = 0; j <= kingaku.size() - 1; j++) {
        if(i >= kingaku.get(j)) t = Math.min(t, dp[i - kingaku.get(j)] + 1);
      }
      dp[i] = t;
    }
    System.out.println(dp[n]);
  }
}