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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;


public class Main {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		
		int n = Integer.parseInt(br.readLine());

		int powers2[] = new int[11];
		int powers3[] = new int[11];
		
		powers2[0] = 1;
		powers3[0] = 1;
		for(int i = 1; i <= 10; i++){
			powers2[i] = 2*powers2[i - 1];
			powers3[i] = 3*powers3[i - 1];
			
//			System.out.println(powers2[i] +" "+ powers3[i]);
		}
		
		int dp[] = new int[n + 1];
		
		dp[1] = 1;
		
		for(int i = 2; i <= n; i++){
			int tmp;
			//タイプa
			tmp = dp[i - 1] + 1;
			
			//タイプb
			for(int j = 0; powers2[j]*powers3[j] <= i ; j++){
				tmp = Math.min(tmp, dp[i - powers2[j]*powers3[j]] + 1);
			}
			
			//タイプc
			for(int j = 0; powers3[j]*powers3[j] <= i ; j++){
				tmp = Math.min(tmp, dp[i - powers3[j]*powers3[j]] + 1);
			}
			
			dp[i] = tmp;
		}
		
		System.out.println(dp[n]);
	}
}
