#include <bits/stdc++.h>
#define int long long 
using namespace std;
int n,t,len,l;
int k;
int i,ans;
__int128 qpow(int x,int y){
	__int128 ans=1;
	while(y){
		if(y&1){
			ans*=x;
		}
		x*=x;
		y>>=1;
	}
	return ans;
}
signed main(){
	cin>>n;
	ans=n; 
	for(int j=log2(n);j>1;j--){
		l=pow(n,1.0/j);
		for(int i=l-1;qpow(i,j)<=n;i++){
				ans=min(ans,n-(int)qpow(i,j)+i+j);
				//cout<<i<<" "<<j<<" "<<n-qpow(i,j)<<endl;
		} 
		
	}             
	cout<<ans<<endl;                
										
	 
    return 0;
}