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

public class Main{
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		TreeSet<Integer> map = new TreeSet<Integer>(Collections.reverseOrder());
		int[] dp = new int[100001];
		Arrays.fill(dp, Integer.MAX_VALUE/2);
		dp[0] = 0;
		/* 1円について */ map.add(1);
		for(int i = 1; i < dp.length; i++) dp[i] = i;
		/* 6円について */ for(int i = 6; i < dp.length; i *= 6) map.add(i);
		/* 9円について */ for(int i = 9; i < dp.length; i *= 9) map.add(i);
		for(int d : map) {
			dp[d] = 1;
			for(int i = 0; i + d < dp.length; i++) dp[i + d] = Math.min(dp[i] + 1, dp[i + d]);
		}
		System.out.println(dp[N]);
	}
}