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;
import java.util.ArrayList;
import java.util.Collections;
public class Main{
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		int n=sc.nextInt();
		ArrayList<Integer> list=new ArrayList<>();
		int nine=1;
		while(nine<=n){
			nine*=9;
			list.add(nine);
		}
		int six=1; 
		while(six<=n){
			six*=6;
			list.add(six);
		}
		list.add(1);
		Collections.sort(list);
		int[] dp=new int[n+1];
		for(int i=0; i<n; i++){
			for(int j=0; j<list.size(); j++){
				int a=list.get(j);
				if(a+i>n){
					break;
				}
				if(dp[a+i]==0){
					dp[a+i]=dp[i]+1;
				}else{
					dp[a+i]=Math.min(dp[a+i],dp[i]+1);
				}
			}
		}
		System.out.println(dp[n]);
	}
}

