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.Scanner;
 
public class Main {
	
	public static void main(String args[]){
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int min = Integer.MAX_VALUE;
		for(int i=0;i<n+1;i++){
			int count =0;
			int cj = i;
			for(int j=1;j<=i;j *= 6){
				count += cj%6;
				cj = cj/6;
			}
			int ck = n-i;
			for(int k=1;k+i<=n;k *= 9){
				count += ck%9;
				ck = ck/9;
			}

			min = Math.min(min,count);

		}

		System.out.println(min);
	}
 
}