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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {

  public static void main(String[] args) {
    new Main().run();
  }

  public void run() {
    
    try(BufferedReader in = new BufferedReader(new InputStreamReader(System.in))) {

      int n = Integer.parseInt(in.readLine());
      int[] dp = new int[n+1];
      dp[0] = 0;
      for(int i=1; i<=n; i++) {
        dp[i] = Integer.MAX_VALUE;
        
        for(int pow = 1; pow <= i; pow *= 6) {
          dp[i] = Math.min(dp[i], dp[i-pow]+1);
        }

        for(int pow = 9; pow <= i; pow *= 9) {
          dp[i] = Math.min(dp[i], dp[i-pow]+1);
        }
      }

      System.out.println(dp[n]);
    }
    catch(IOException e) {
      System.err.println(e);
    }
  }
}