#include <iostream>
#include <cmath>
using namespace std;
long long kpow(long long x, long long n)
{
    if (n == 0)
        return 1;
    long long t = 1;
    while (n)
    {
        if (n & 1)
            t *= x;
        n >>= 1;
        x *= x;
    }
    return t;
}
int main()
{
    long long n;
    scanf("%lld", &n);
    long long ans = n;
    long long i = 0, j = 0, k = n;
    long long lst = n;

    while (1)
    {
        j++;
        i = pow(n, 1.0 / j);
        long long tmp1 = kpow(i + 1, j);
        long long tmp2 = kpow(i, j);
        if (tmp1 <= n&&tmp1>=0)
        {
            k = n - tmp1;
            ans = min(ans, i + j + k+1);
        }
        else
        {
            k = n - tmp2;
            ans = min(ans, i + j + k);
        }

        if (i == 1)
        {
            ans = min(ans, n);
            printf("%lld\n", ans);
            break;
        }
    }
  
    return 0;
}