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

public class Main{

	public static void main(String[] args) {
		final int INF = Integer.MAX_VALUE;
		Scanner scn = new Scanner(System.in);
		int N = scn.nextInt();
		ArrayList<Integer> coins = new ArrayList<Integer>();
		coins.add(1);
		for(int i = 1; ;i++) {
			int buf = (int)Math.pow(6, i);
			if(buf > N)break;
			coins.add(buf);
		}
		for(int i = 1; ;i++) {
			int buf = (int)Math.pow(9, i);
			if(buf > N)break;
			coins.add(buf);
		}
		int[] DP = new int[N+1];
		DP[0] = 0;
		for(int i = 1;i <= N;i++) {
			DP[i] = INF;
		}

		int length = coins.size();
		for(int i = 1;i <=N;i++) {
			for(int j = 0;j < length;j++) {
				int coin = coins.get(j);
				if(i >= coin) {
					DP[i] = Math.min(DP[i], DP[i-coin]+1);
				}
			}
		}
		System.out.println(DP[N]);
	}

}
