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


public class Main {

    public static void main(String[] args) {

    	Main main=new Main();

    	main.run();

    }

    void run() {

    	Scanner sc=new Scanner(System.in);
    	int N=sc.nextInt();

    	int sum=0;

    	List<Integer> data=new ArrayList<Integer>();

    	int result=1;

    	data.add(result);

    	while(true) {

    		if(N>=result*9) {
    			result*=9;
    			data.add(result);
    		}else {
    			break;
    		}

    	}

    	result=1;

    	while(true) {

    		if(N>=result*6) {
    			result*=6;
    			data.add(result);
    		}else {
    			break;
    		}

    	}

    	Collections.sort(data);



    	int[] dp=new int[N+1];

    	Arrays.fill(dp,99999999);
    	dp[0]=0;

    	for(Integer I:data) {
    		for(int j=0;j<=N;j++) {

    			if(j-I>=0) {
    				dp[j]=Math.min(dp[j],dp[j-I]+1);
    			}
    		}
    	}


    	System.out.println(dp[N]);


    }


}

