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.*;

class Main{
	
public static void main(String args[]) {
	Scanner s=new Scanner(System.in);

	int n=s.nextInt();
	int a[]=new int[n+1];
	a[1]=1;
	int b[]= {6,9};
	for(int i=2;i<=n;i++) {
		a[i]=Integer.MAX_VALUE;
		a[i]=Math.min(a[i-1]+1,a[i]);
		for(int j=1;j<n&&Math.pow(6, j)<=i;j++) {
			a[i]=Math.min(a[i], a[i-(int)Math.pow(6,j)]+1);
		}
		for(int j=1;j<n&&Math.pow(9, j)<=i;j++) {
			a[i]=Math.min(a[i], a[i-(int)Math.pow(9,j)]+1);
		}
		
	}
	System.out.println(a[n]);
	
}




}
