#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

ll n;

bool f(ll i, ll j){
    ll m=1;
    for (int k=0; k<j; k++){
        if (m >= n/i+1) return 0;
        m *= i;
    }
    return 1;
}

int main(){

    ll ans;
    cin >> n;
    ans = n;

    for (int j=1; j<=60; j++){
        ll l=1, r=n+1, c;
        while(r-l>1){\
            c = (l+r)/2;
            if (f(c, j)) l=c;
            else r=c;
        }
        ll m=1;
        for (int k=0; k<j; k++) m *= l;
        ans = min(ans, l+j+n-m);
    }

    cout << ans << endl;

    return 0;
}