#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,1,0,-1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}
typedef __int128 l2;
istream& operator>>(istream& i, l2& x) {
  x = 0;
  string s;
  i >> s;
  int N = s.size(), it = 0;
  if (s[0] == '-') it++;
  for (; it < N; it++) x = (x * 10 + s[it] - '0');
  if (s[0] == '-') x = -x;
  return i;
}
ostream& operator<<(ostream& o, const l2& x) {
  ll tmp = x;
  if (tmp == 0) return o << 0;
  if (tmp < 0) o << '-', tmp = -tmp;
  vector<int> ds;
  while (tmp) ds.push_back(tmp % 10), tmp /= 10;
  reverse(ds.begin(), ds.end());
  for (int d : ds) o << d;
  return o;
}
int main(){
  ll n;cin >> n;
  l2 ans=n;
  ll p=sqrt(n)-1;chmax(p,0LL);
  for(;p*p<=n;p++){
    chmin(ans,(l2)p+2+n-p*p);
  }
  for(ll i=3;i<=60;i++){
    for(ll j=1;;j++){
      l2 ret=1;
      rep(_,i)ret*=j;
      if(ret>n)break;
      chmin(ans,j+i+n-ret);
    }
  }
  cout << ans << endl;
}