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.*;

public class Main {
    public static void main(String args[]) throws Exception {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        
        int cnt6 = 0;
        while(Math.pow(6, cnt6 + 1) <= n)
        	cnt6++;

        int cnt9 = 0;
        while(Math.pow(9, cnt9 + 1) <= n)
        	cnt9++;

        List<Integer> coins = new ArrayList<>();
        coins.add(1);
        for(int i = 0; i <= cnt6; i++)
        	coins.add((int) Math.pow(6, i));
        for(int i = 0; i <= cnt9; i++)
        	coins.add((int) Math.pow(9, i));

        int[][] dp = new int[coins.size() + 1][n+1];
        for(int i = 1; i <= n; i++) 
            dp[0][i] = Integer.MAX_VALUE;
            
        for(int i = 1; i <= coins.size(); i++) {
            int coin = coins.get(i - 1);
        	for(int j = 1; j <= n ; j++) {
        	    if(j < coin) dp[i][j] = dp[i-1][j];
        	    else dp[i][j] = Math.min(dp[i-1][j], 1 + dp[i][j - coin]);
        	}
        }
        System.out.println(dp[coins.size()][n]);
    }
}
