#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#include <atcoder/all>
#define popcount __builtin_popcount
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<int, int> P;

int main()
{
    ll n; cin>>n;
    ll ans=n;
    using lll=__int128_t;
    for(int j=2; j<60; j++){
        ll l=1, r=1e9+7;
        while(r-l>1){
            ll m=(l+r)/2;
            lll x=1;
            for(int i=0; i<j; i++){
                x*=m;
                if(x>n){
                    break;
                }
            }
            if(x>n) r=m;
            else l=m;
        }
        //cout<<j<<" "<<l<<endl;
        ll x=1;
        for(int i=0; i<j; i++){
            x*=l;
        }
        ans=min(ans, j+l+n-x);
    }
    cout<<ans<<endl;
    return 0;
}