#include <bits/stdc++.h>
using namespace std;

using ll = long long;

ll modpow(ll x, ll n, int mod){
  ll ret = 1;
  if(mod == 0){
    while(n > 0){
      if(n & 1) ret *= x;
      x *= x;
      n >>= 1;
    }
  }else{
    while(n > 0){
      if(n & 1) ret = ret * x % mod;
      x = x * x % mod;
      n >>= 1;
    }
  }
  return ret;
}

int main(){
  ll x; cin >> x;
  ll ans = LLONG_MAX;
  for(ll i = 2LL; i <= sqrt(x); i++){
    ll j = log(x) / log(i);
    ll k = x - modpow(i, j, 0);
    ans = min(ans, i + j + k);
  }
  cout << ans << endl;
}