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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.nio.charset.StandardCharsets;
import java.util.*;

public class Main {

    List<Integer> array = new ArrayList<>();
    int[] ans;

    public static void main(String[] args) throws IOException {
        new Main().run();
    }

    void run() {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        ans = new int[N+1];

        array.add(1);

        for(int i=6; i<=N; i*=6){
            array.add(i);
        }

        for(int i=9; i<=N; i*=9){
            array.add(i);
        }

        Collections.sort(array);

        for(int i=0; i<=N; i++){
            ans[i] = 100000;
        }

        ans[0] = 0;

        for(int i=1; i<=N; i++){
            for(int j: array){
                if(i < j) break;
                ans[i] = Math.min(ans[i], ans[i - j]+1);
            }
        }

        System.out.println(ans[N]);
    }

}