#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, x, n) for (int i = x; i <= n; i++)
#define rep3(i, x, n) for (int i = x; i >= n; i--)
#define each(e, v) for (auto &e : v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int inf = (1 << 30) - 1;
const ll INF = (1LL << 60) - 1;
template <typename T>
bool chmax(T &x, const T &y) {
    return (x < y) ? (x = y, true) : false;
};
template <typename T>
bool chmin(T &x, const T &y) {
    return (x > y) ? (x = y, true) : false;
};

struct io_setup {
    io_setup() {
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

template <typename T>
T kth_root_int(T a, int k) {
    if (a == 1 || k == 1) return a;
    T L = 0, R = a;
    while (R - L > 1) {
        T M = (L + R) / 2;
        T x = 1;
        bool flag = true;
        for (int i = 0; i < k; i++) {
            if (x > a / M) {
                flag = false;
                break;
            }
            x *= M;
        }
        (flag ? L : R) = M;
    }
    return L;
}

int main() {
    ll N;
    cin >> N;

    ll ans = N;

    rep2(i, 1, 64) {
        ll x = kth_root_int(N, i);
        ll y = 1;
        rep(j, i) y *= x;
        chmin(ans, x + i + N - y);
    }

    cout << ans << '\n';
}