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){
    	int exp6,exp9;
    	Scanner sc = new Scanner(System.in);
         int value=sc.nextInt();
         
         for(exp6=1;Math.pow(6,exp6)<=value;exp6++);
 		for(exp9=1;Math.pow(9,exp9)<=value;exp9++);
 		exp6--;exp9--;
 		
         System.out.println(Math.min(pulloutcount(value,(int)Math.pow(6,exp6),1),pulloutcount(value,(int)Math.pow(9,exp9),1)));
         }

public static int pulloutcount(int value,int pullout,int count) {
	int exp6,exp9;
	value-=pullout;
	if(value<=5) {
		return value+count;
	}else {
		for(exp6=1;Math.pow(6,exp6)<=value;exp6++);
		for(exp9=1;Math.pow(9,exp9)<=value;exp9++);
		exp6--;exp9--;
		
		return Math.min(pulloutcount(value,(int)Math.pow(6,exp6),count+1),pulloutcount(value,(int)Math.pow(9,exp9),count+1));
	}
	
	
}


}