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{
    static int N;
    static int min;
    public static void main(String args[]){
        Scanner sc = new Scanner(System.in);
        
        N = sc.nextInt();
        sc.close();
        min = N;
        for(int i = 0; i <= N; i++){
            int by_6 = i;
            int by_9 = N-i;
            int count = 0;
            while(by_6 > 0){
                count += (by_6 % 6);
                by_6 /= 6;
            }
            while(by_9 > 0){
                count += (by_9 % 9);
                by_9 /= 9;
            }
            min = Math.min(count, min);
        }
        System.out.println(min);
    }

}