#include <stdio.h>
#include <iostream>
#include <algorithm> 
using namespace std;
int main(){
	int i,j,k,l,m,n,ans=1000000;
	scanf("%d",&n);
	for(i=0;i<=n;i++){
	j=i;
	k=n-i;
	l=0;
	while(j){
	l+=j%6;
	j/=6;
	}
		while(k){
	l+=k%9;
	k/=9;
	}
	if(l<ans)ans=l;
	}
	printf("%d",ans);
	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 <stdio.h>
#include <iostream>
#include <algorithm> 
using namespace std;
int main(){
	int i,j,k,l,m,n,ans=1000000;
	scanf("%d",&n);
	for(i=0;i<=n;i++){
	j=i;
	k=n-i;
	l=0;
	while(j){
	l+=j%6;
	j/=6;
	}
		while(k){
	l+=k%9;
	k/=9;
	}
	if(l<ans)ans=l;
	}
	printf("%d",ans);
	return 0;
	
} 
```