#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define rep(i,a,b) for(int i = a; i < (b); i++)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define PB push_back
#define FS first
#define SD second
#define ary(k) array<int,k>
template<class A, class B> void cmx(A& x, B y){ x = max<A>(x,y); }
template<class A, class B> void cmn(A& x, B y){ x = min<A>(x,y); }
typedef pair<int,int> pii;
typedef vector<int> vi;

int pot[60];

signed main(){
	cin.tie(0)->sync_with_stdio(0); cin.exceptions(cin.failbit);
    int n;
    cin >> n;
    int best = n;
    pot[0] = 1;
    for (int i = 1; i < 40; i++) {
        pot[i] = pot[i-1] * 3;
    }
    for (int t = 1; t < 40; t++) {
        int akt = n, res = 0;
        for (int i = 0; i <= t; i++) {
            if (i == 0 || i == t) {
                akt -= pot[i];
                res++;
            } else {
                akt -= 2*pot[i];
                res += 2;
            }
        }
        if (akt < 0)
            break;
        for (int i = t; i >= 0; i--) {
            res += akt/pot[i];
            akt %= pot[i];
        }
        cmn(best, res);
    }
    cout << best << "\n";
}