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,i,cnt = 1;
		n = sc.nextInt();
		
		System.out.println(sum(n,0,100000));
		
	}
	public static int sum(int n,int cnt,int min){
		int six = 6,nine = 9;
		int tmp;
		if(cnt > min){
			return 100000;
		}
		if(n < 6){
			return cnt + n;
		}
		
		while(six <= n){
			six *= 6;
		}
		six /= 6;
		
		tmp = sum(n - six,cnt + 1,min);
		if(tmp < min){
			min = tmp;
		}

		while(nine <= n){
			nine *= 9;
		}
		nine /= 9;
		
		tmp = sum(n - nine,cnt + 1,min);
		if(tmp < min){
			min = tmp;
		}

		return min;
	}
}