#include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
const int INF = 1e9;
//const long long LINF = 1e18;
//const bool debug = false;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

bool f(long long x, int y, long long n) {
	// i^j <= n ならtrue;
	long long mul = 1;
	rep(i, y) {
		if (mul <= (n / x))mul *= x;
		else return false;
	}
	return  true;
}
long long pw(int x, int y) {
	//cout << x << " " << y << endl;
	long long ret = 1;
	long long sub = x;
	while (y > 0) {
		if (1 == y % 2) ret *= sub;
		y /= 2;
		sub *= sub;
	}
	//cout << ret << endl;
	return ret;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	long long n; cin >> n;
	//n = i ^ j + k 
	// 0 == j :1^0 + (n-1)
	long long ans = n;
	rep2(i, 2, 61) {
		long long pw2 = 1LL << i;
		if (pw2 > n)continue;
		long long ok = 2;
		long long ng = INF + 1;
		while (1 < abs(ok - ng)) {
			long long c = (ng + ok) / 2;
			if (f(c, i, n)) ok = c;
			else ng = c;
		}
		long long k = n - pw((int)ok, i);
		//cout << ok << " " << i << " " << k << endl;
		chmin(ans, ok + i + k);
	}
	cout << ans << endl;
	return 0;
}