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.*;
public class Main {
	public static void main(String[] args){
		strangeBank();
	}
	
	public static void strangeBank() {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		System.out.println(strangeBankhelper(n, 0));
	}
	
	public static int strangeBankhelper(int n, int res) {
		if (n < 6) {
			return n + res;
		}
		int ninetemp = 9;
		while (n - ninetemp >= 0) {
			ninetemp *= 9;
		}
		ninetemp /= 9;
		int sixtemp = 6;
		while (n - sixtemp >= 0) {
			sixtemp *= 6;
		}
		sixtemp /= 6;
		return Math.min(strangeBankhelper(n-sixtemp, res+1), strangeBankhelper(n-ninetemp, res+1));
	}
}