#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

int main() {
    ll a;
    cin >> a;
    if(a == 5) {
        puts("5");
        return 0;
    }
    vector<ll> p2{1}, p3{1};
    while(p2.back() < a) p2.emplace_back(p2.back()*2);
    while(p3.back() < a) p3.emplace_back(p3.back()*3);
    int ans = INF<int>;
    for (int i = 0; i < p2.size(); ++i) {
        if(p2[i] >= a) {
            ans = min(ans, i*2);
            break;
        }
    }
    for (int i = 0; i < p3.size(); ++i) {
        if(p3[i] >= a) {
            ans = min(ans, i*3);
            break;
        }
    }
    cout << ans << "\n";
    return 0;
}