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.Collections;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Scanner;
import java.util.stream.Collectors;

public class Main {

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

		list.add(1);
		for(int i = 6; i<=n; i*=6) list.add(i);
		for(int i = 9; i <= n; i *= 9) list.add(i);
		Collections.sort(list);
		Collections.reverse(list);
		System.out.println(count(n));
	}

	static Map<Integer, Integer> map = new HashMap<>();
	static List<Integer> list = new ArrayList<>();
	public static int count(int n) {
		if(map.containsKey(n)) return map.get(n);
		if(n == 0) return 0;
		int min = n;
		for(int i : list.parallelStream().filter(i -> i <= n).collect(Collectors.toList())) {
			int count = 1;
			count += count(n-i);
			if(min > count) min = count;
		}

		map.put(n, min);
		return min;
	}
}