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.*;
import static java.lang.Math.*;
import java.math.BigInteger;

public class Main {
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		
		// 入力
		int n = sc.nextInt();
		
		// 計算
		int result = 0;
		TreeSet<Integer> ts = new TreeSet<Integer>();
		int tmp = 1;
		while(tmp <= n){
		    ts.add(tmp);
		    tmp *= 6;
		}
		tmp = 1;
		while(tmp <= n){
		    ts.add(tmp);
		    tmp *= 9;
		}
		int[] dp = new int[n+1];
		Arrays.fill(dp, Integer.MAX_VALUE);
		dp[0] = 0;
		for(int i = 0; i < n+1; i++){
		    for(Integer j : ts){
		        if(i + j > n) break;
		        dp[i + j] = min(dp[i] + 1, dp[i + j]);
		    }
		}
		result = dp[n];
		
		// 出力
		System.out.println(result);
	}
}
