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.Arrays;
import java.util.Scanner;

public class Main {

    static int dp[];

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int count = 0;
        dp = new int[N+1];
        Arrays.fill(dp,-1);

        System.out.println(dpfunc(N));

    }

    static int dpfunc(int n ){
        if(dp[n] != -1) return dp[n];
        if(n==0) return 0;

        int min = Integer.MAX_VALUE;
        if(n-1>=0){
            int res = dpfunc(n-1);
            min = res<min?res:min;
        }
        int num = 1;
        while(n-Math.pow(6,num) >=0){
            int res = dpfunc((int)(n-Math.pow(6,num)) );
            min = res<min?res:min;
            num++;
        }
        num = 1;
        while(n-Math.pow(9,num) >=0){
            int res = dpfunc((int)(n-Math.pow(9,num)) );
            min = res<min?res:min;
            num++;
        }

        dp[n]= min+1;
        return min+1;
    }

}
