#include<bits/stdc++.h>
using namespace std;
int biter(int x,int y){
  int ans = 0;
  while(x){
    ans += x%y;x /= y;
  }
  return ans;
}
int main(){
  int n,i,ans = 100000,a,b,c;cin >> n;
  for(i=0;i*9<=n;i++){
    c = i*9;a = (n-c)%6;b = n-a-c;
    ans = min(ans,a+biter(b/6,6)+biter(c/9,9));
  }
  cout << ans << "\n";
}
  
### 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 biter(int x,int y){
  int ans = 0;
  while(x){
    ans += x%y;x /= y;
  }
  return ans;
}
int main(){
  int n,i,ans = 100000,a,b,c;cin >> n;
  for(i=0;i*9<=n;i++){
    c = i*9;a = (n-c)%6;b = n-a-c;
    ans = min(ans,a+biter(b/6,6)+biter(c/9,9));
  }
  cout << ans << "\n";
}
  
```