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

public class Main {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		
		int[] dp = new int[100001];
		for(int i=1;i<=5;i++) {
			dp[i] = i;
		}
		for(int i=6;i<=8;i++) {
			dp[i] = i-5;
		}
		int sixPow = 6;
		int ninePow = 9;
		for(int i=9;i<=n;i++) {
			if(sixPow*6<=i) sixPow *= 6;
			if(ninePow*9<=i) ninePow *= 9;
			dp[i] = Math.min(dp[i-1]+1, Math.min(dp[i-sixPow]+1, dp[i-ninePow]+1));
		}
		
		System.out.println(dp[n]);
		in.close();
	}

}