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){
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int[] dp = new int[160000];
		dp[0] = 0;
		for(int i=1;i<160000;++i) dp[i] = Integer.MAX_VALUE;
		int[] six = {6,36,216,1296,7776,46656};
		int[] nine = {9,81,729,6561,59049};
		
		for(int i=0;i<100000;++i){
			for(int ones=1;ones<=5;ones++) dp[i+ones] = Math.min(dp[i+ones], dp[i]+ones);
			for(int j=0;j<6;++j) dp[i+six[j]] = Math.min(dp[i+six[j]], dp[i]+1);
			for(int j=0;j<5;++j) dp[i+nine[j]] = Math.min(dp[i+nine[j]], dp[i]+1);
		}
		
		System.out.println(dp[N]);
		return;
	}
}