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 {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        sc.close();
        int[] A = new int[13];
        A[1] = 1;
        int cnt = 1;
        int idx = 0;
        while(true){
            idx++;
            if(Math.pow(6, idx) > N) break;
            else {
                cnt++;
                A[cnt] = (int) Math.pow(6, idx);
            }
        }
        idx = 0;
        while(true){
            idx++;
            if(Math.pow(9, idx) > N) break;
            else {
                cnt++;
                A[cnt] = (int) Math.pow(9, idx);
            }
        }

        //dp[i][j]:ｉパターン目までの引き落とし金額でj円ちょうど引き出すのに少なくとも必要な回数
        int[][] dp = new int[cnt+1][N+1];
        Arrays.fill(dp[0], Integer.MAX_VALUE);
        dp[0][0] = 0;
        for(int i = 1; i < cnt+1; i++){
            dp[i][0] = 0;
            for(int j = 1; j < N+1; j++){
                if(A[i] > j) dp[i][j] = dp[i-1][j];
                else dp[i][j] = Math.min(dp[i-1][j], dp[i][j - A[i]] + 1);
            }
        }
        System.out.println(dp[cnt][N]);

    }

}
