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.ArrayList;
import java.util.Arrays;
import java.util.Scanner;

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

		ArrayList<Integer> m=new ArrayList<>();
		m.add(1);
		for(int x=6;x<=N;x*=6) m.add(x);
		for(int x=9;x<=N;x*=9) m.add(x);
		
		int[] a=new int[N+1];
		Arrays.fill(a, N+1);
		a[0]=0;
		int p=0;
		while(p<N){
			for(int x:m){
				if(p+x>N)continue;
				a[p+x]=Math.min(a[p]+1, a[p+x]);
			}
			p++;
		}
		
		System.out.println(a[N]);
	}

	public static int gcd(int a, int b) {
		return a%b==0 ? b : gcd(b,a%b);
	}
}
