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

int main()
{
	long long n;
	cin >> n;

	auto power = []( long long x, long long n )
	{
		long long res = 1;
		while( n > 0 ) {
			if( n % 2 ) res = res * x;
			x  = x * x;
			n /= 2;
		}
		return res;
	};
	long long ans = INT64_MAX;
	for( long long j = 1; ; j++ ) {
		double p = (double)1/ j;
		double r = pow( n, p );
		long long i = r;
		long long k = n - power( i, j ); 
		if( power( i, j ) == 1 ) {
			ans = min( ans, 1 + k );
		}
		else {
			ans = min( ans, i + j + k );
		}
		if( k > i + j ) {
			i++;
			k = n - power( i, j );
			if( k >= 0 ) {
				ans = min( ans, i + j + k );
			}
			i--;
		}
		if( i == 1 ) break;
	}

	cout << ans << endl;
}