#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
int nine(int x){
  if(x<9) return x;
  return x%9+nine(x/9);
}
int six(int x){
  if(x<6) return x;
  return x%6+six(x/6);
}
int main(){
  int N;
  cin >> N;
  int ans=N;
  rep(i,N+1){
    ans=min(ans,nine(i)+six(N-i));
  }
  cout << ans << endl;
  return 0;
}
### Prompt

Develop a solution in cpp to the problem described below:

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>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
int nine(int x){
  if(x<9) return x;
  return x%9+nine(x/9);
}
int six(int x){
  if(x<6) return x;
  return x%6+six(x/6);
}
int main(){
  int N;
  cin >> N;
  int ans=N;
  rep(i,N+1){
    ans=min(ans,nine(i)+six(N-i));
  }
  cout << ans << endl;
  return 0;
}
```