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.io.*;
import java.util.*;

class Main{
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int n = scan.nextInt();
		int nine = (n/9);
		n-=nine*9;
		int six = n/6;
		n-=six*6;
		int one = n;
		int ans = 99999999;
		while(nine>=0) {
			int sum = 0;
			sum += calc(9,nine);
			sum += calc(6,six);
			sum += one;
			ans = Math.min(ans,sum);
			nine--;
			six+=1;
			one+=3;
			if(one>=6) {
				six++;
				one-=6;
			}
		}
		System.out.println(ans);
	}

	public static int calc(int num, int all) {
		int max = 1;
		int result = 0;
		while(max*num<=all) max *= num;
		while(max>0) {
			int count = all/max;
			result += count;
			all -= count*max;
			max /= num;
		}
		return result;
	}
}
