#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
#include<cstdio>
#include<cstdlib>
#include<numeric>
using namespace std;

#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
#define MOD 1000000007
//#define MOD 998244353
#define LINF (long long)4e18
#define jck 3.141592

const double EPS = 1e-10;

using ll = long long;
using Pi = pair<int,int>;
using Pl = pair<ll,ll>;


int main(){
    ll a; cin >> a;
    ll ans = a;
    for(int i = 2; i*i*i <= a; i++){
        ll cnt = 0;
        ll now = 1;
        while(true){
            now *= i;
            cnt++;
            if(now >= a/i) break;
        }
        ans = min(ans,i*(cnt+1));
    }
    ll k = (ll)sqrt(a);
    if(k*k >= a) ans = min(ans,k*2);
    else ans = min(ans,(k+1)*2);
    cout << ans << endl;
}