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

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int[] dp = new int[N+1];
        for(int n=0; n<=N; n++) dp[n] = n;
        for(int n=1; n<=N; n++){
            int m = 1;
            while(m<=N){
                if(n>=m) dp[n] = Math.min(dp[n], 1+dp[n-m]);
                m *= 6;
            }
            m = 1;
            while(m<=N){
                if(n>=m) dp[n] = Math.min(dp[n], 1+dp[n-m]);
                m *= 9;
            }
        }
        System.out.println(dp[N]);
    }
}
