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{
  static int[] dp;
  public static void main(String[] args){
    Scanner sc=new Scanner(System.in);
    int n=sc.nextInt();
    dp=new int[n+4];
    dp[1]=1; dp[2]=2; dp[3]=3;
    System.out.println(dp(n));
  }
  static int dp(int n){
    int ret=Integer.MAX_VALUE-1;
    if(n==0||dp[n]>0) return dp[n];
    for(int i=2;i<=3;i++){
      for(int j=3*i;j<=n;j*=3*i){
        ret=Math.min(ret, dp(n-j));
      }
    }
    return dp[n]=ret+1;
  }
}
