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

#define rep(i, n) for(int i = 0, i_length = (n); i < i_length; i++)
#define MOD 1000000007
#define ll long long

ll power(ll a, ll p) {
	ll ret = 1;
	for (ll i = 1; i <= p; i *= 2, a *= a)
	{
		if ((i & p) > 0) ret *= a;
	}
	return ret;
}

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

	if (n == 1) {
		cout << 2 << endl;
		return 0;
	}
	if (n == 2) {
		cout << 3 << endl;
		return 0;
	}

	ll ans = 1000000000000;

	for (ll a = 1; a * a <= n; a++)
	{
		if (n % a != 0) continue;
		ll an = n / a;
		for (int i = 2; i <= 40; i++)
		{
			ll ng = (ll)(pow(1000000000000000000, 1.0 / i) + 5);
			ll ok = 1;
			while (ng - ok > 1)
			{
				ll mid = ok + (ng - ok) / 2;
				ll t = (power(mid, i) - 1) / (mid - 1);
				if (t == an) {
					if (a < mid) {
						ans = min(ans, mid);
					}
					break;
				}
				if (t > an) ng = mid;
				else ok = mid;
			}
		}
	}

	cout << ans << endl;
	return 0;
}