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.ArrayDeque;
import java.util.Queue;
import java.util.Scanner;
 
public class Main {
 
	public static void main(String[] args) {
		class Data {
			public int n;
			public int count;
			
			public Data(int n, int count) {
				this.n = n;
				this.count = count;
			}
		}
		Scanner sc = new Scanner(System.in);
		
		int N = sc.nextInt();
		
		Queue<Data> queue = new ArrayDeque<>();
		queue.add(new Data(N, 0));
		
		for (; ;) {
			Data d = queue.poll();
			if (d.n == 0) {
				System.out.println(d.count);
				return;
			}
			
			int six = calc(d.n, 6);
			if (six > 0) queue.add(new Data(d.n - six, d.count + 1));
			int nine = calc(d.n, 9);
			if (nine > 0) queue.add(new Data(d.n - nine, d.count + 1));
			if (six == 0 && nine == 0) {
				queue.add(new Data(d.n - 1, d.count + 1));
			}
		}
	}
	
	private static int calc(int n, int a) {
		if (a > n) {
			return 0;
		}
		int b = a;
		
		while (true) {
			if (b * a > n) {
				break;
			} else {
				b *= a;
			}
		}
		
		return b;
	}
}