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

import static java.lang.System.in;

public class Main {
    static int[] six = new int[]{46656,7776,1296,216,36,6};
    static int[] nine = new int[]{59049,6561,729,81,9};
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int ans = n;
        for(int i=0;i<=n;i++) ans = Math.min(ans,help(n,i));
        System.out.println(ans);
    }
    static int help(int n, int m){
        int ans = 0;
        int t = n-m;
        for(int i=0;i<6;i++){
            if(m>=six[i]){
                ans += m/six[i];
                m = m%six[i];
            }
        }
        for(int i=0;i<5;i++) {
            if (t >= nine[i]) {
                ans += t / nine[i];
                t = t % nine[i];
            }
        }
        return ans+t+m;
    }
}
