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


public class Main {
	
	
	private void doit(){
		Scanner sc = new Scanner(System.in);
		while(sc.hasNext()){
			int n = sc.nextInt();
			int [] dp = new int[n+1];
			Arrays.fill(dp, 1 << 29);
			dp[0] = 0;
			for(int i = 0; i <= n; i++){
				if(i + 1 > n)continue;
				dp[i+1] = Math.min(dp[i+1], dp[i] + 1);
				
				int now = 6;
				while(i + now <= n){
					dp[i + now] = Math.min(dp[i + now], dp[i] + 1);
					now = now * 6;
				}
				
				now = 9;
				while(i + now <= n){
					dp[i + now] = Math.min(dp[i + now], dp[i] + 1);
					now = now * 9;
				}
			}
			System.out.println(dp[n]);
		}
	}
	
	private long calc(long n, long m, long l){
		long sum = 1;
		for(long i = n; i > m; i--){
			sum *= i;
		}
		for(long i = 2; i <= l; i++){
			sum /= i;
		}
		return sum;
	}

	private void debug(Object... o) {
		System.out.println("debug = " + Arrays.deepToString(o));
	}

	public static void main(String[] args) {
		new Main().doit();
	}

}
