#include <bits/stdc++.h>
#define int long long 
using namespace std;
double e=2.718;
int n,t,len,l;
int k;
int i,ans;
int erfen(int l,int r,int k){
	while(l<=r){
		int mid=(l+r)>>1;
		if(pow(mid,k)>n){
			r=mid-1;
		}
		else{
			l=mid+1;
		}
	}
	return r;
}
signed main(){
	cin>>n;
	ans=t=n;
	while(t){
		len++;
		t>>=1;
	}
	double N=log(n);
	l=2;
	for(int j=len;j;j--){
		l=erfen(l,n,j);
		ans=min(ans,n-(int)pow(l,j)+l+j);
		//cout<<i<<" "<<j<<" "<<k<<endl;
	}
	cout<<ans;
    return 0;
}