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.io.*;
import java.util.*;

class Main {

	public static void main(String[] args) throws Exception {
		final Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		solve(N);
	}

	static void solve(int n) {
		int a = 1, b = 1;
		int ca = 0, cb = 0;
		while (a < n) {
			a *= 6;
			ca++;
		}
		while (b < n) {
			b *= 9;
			cb++;
		}

		int[][] dp = new int[1 + ca + cb + 1][n + 1];
		for (int i = 0; i < n + 1; i++) {
			dp[0][i] = i;
		}

		a = 6;
		for (int i = 1; i <= ca; i++) {
			for (int j = 0; j < n + 1; j++) {
				dp[i][j] = dp[i - 1][j];
				if (j >= a) {
					dp[i][j] = Math.min(dp[i][j], dp[i - 1][j - a] + 1);
					dp[i][j] = Math.min(dp[i][j], dp[i][j - a] + 1);
				}
			}
			a *= 6;
		}

		b = 9;
		for (int i = ca + 1; i < dp.length; i++) {
			for (int j = 0; j < n + 1; j++) {
				dp[i][j] = dp[i - 1][j];
				if (j >= b) {
					dp[i][j] = Math.min(dp[i][j], dp[i - 1][j - b] + 1);
					dp[i][j] = Math.min(dp[i][j], dp[i][j - b] + 1);
				}
			}
			b *= 9;
		}

		System.out.println(dp[dp.length - 1][n]);
	}
}
