#include <bits/stdc++.h>
using namespace std;
int N;
int memo[100009];

int dp(int n){
  if(n==0){return 0;}
  else if(memo[n]!=0){return memo[n];}
  else{
    int ans=n;
    for(int i=1;i<=n;i*=6){ans=min(ans,dp(n-i)+1);}
    for(int i=9;i<=n;i*=9){ans=min(ans,dp(n-i)+1);}
    return memo[n]=ans;
  }
}

int main(){
  cin >> N;
  cout << dp(N) << endl;
}
### Prompt

Create a solution in CPP for the following problem:

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

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
int N;
int memo[100009];

int dp(int n){
  if(n==0){return 0;}
  else if(memo[n]!=0){return memo[n];}
  else{
    int ans=n;
    for(int i=1;i<=n;i*=6){ans=min(ans,dp(n-i)+1);}
    for(int i=9;i<=n;i*=9){ans=min(ans,dp(n-i)+1);}
    return memo[n]=ans;
  }
}

int main(){
  cin >> N;
  cout << dp(N) << endl;
}
```