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;

public class Main{
  public static void main(String[] args){
    Scanner scanner = new Scanner(System.in);
    int N = scanner.nextInt();
    int[] dp = new int[100010];
    dp[0] = 0;
    for (int i = 1; i < 100010; i++){
      dp[i] = i;
    }
    int[] coins = {1, 6, 9, 36, 81, 216, 729, 1296, 6561, 7776, 46656, 59049};

    for (int i = 0; i < 100010; i++){
      for (int j = 0; j < 12; j++){
        if(i-coins[j] < 0) continue;
        dp[i] = Math.min(dp[i - coins[j]] + 1, dp[i]);
      }
    }
    System.out.println(dp[N]);
  }
}