#include <bits/stdc++.h>
using namespace std;

int N;
int coin[12]={59049,46656,7776,6561,1296,729,216,81,36,9,6,1};
int mai[100001];

int main(){
  cin >> N;
  mai[0]=0;
  for(int i=1; i<=N; i++){
    mai[i]=100000;
    for(int j=0; j<12; j++){
      if(i-coin[j]>=0){
        mai[i]=min(mai[i],mai[i-coin[j]]+1);
      }
    }
  }
  cout << mai[N] << endl;
}
### Prompt

Generate a CPP solution to 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 coin[12]={59049,46656,7776,6561,1296,729,216,81,36,9,6,1};
int mai[100001];

int main(){
  cin >> N;
  mai[0]=0;
  for(int i=1; i<=N; i++){
    mai[i]=100000;
    for(int j=0; j<12; j++){
      if(i-coin[j]>=0){
        mai[i]=min(mai[i],mai[i-coin[j]]+1);
      }
    }
  }
  cout << mai[N] << endl;
}
```