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

int main(){
  int i,j,cnt=0;
  int n;
  cin>>n;
  int d[n+1];
  d[0]=0;
  for(i=1;i<=n;i++)d[i]=INT_MAX;
  int a[12]={1,6,9,36,81,216,729,1296,6561,7776,46656,59049};
  for(i=1;i<=n;i++){
    for(j=0;j<12;j++){
      if(a[j]>i)break;
      d[i]=min(d[i],d[i-a[j]]+1);
    }
  }
  cout<<d[n];
}
### 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;
using ll=long long;

int main(){
  int i,j,cnt=0;
  int n;
  cin>>n;
  int d[n+1];
  d[0]=0;
  for(i=1;i<=n;i++)d[i]=INT_MAX;
  int a[12]={1,6,9,36,81,216,729,1296,6561,7776,46656,59049};
  for(i=1;i<=n;i++){
    for(j=0;j<12;j++){
      if(a[j]>i)break;
      d[i]=min(d[i],d[i-a[j]]+1);
    }
  }
  cout<<d[n];
}
```