#include<bits/stdc++.h>
#define int long long

using namespace std;

#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

typedef unsigned long long ull;
ull modmul(ull a, ull b, ull M) {
	ll ret = a * b - M * ull(1.L / M * a * b);
	return ret + M * (ret < 0) - M * (ret >= (ll)M);
}
ull modpow(ull b, ull e, ull mod) {
	ull ans = 1;
	for (; e; b = modmul(b, b, mod), e /= 2)
		if (e & 1) ans = modmul(ans, b, mod);
	return ans;
}

bool isPrime(ull n) {
	if (n < 2 || n % 6 % 4 != 1) return (n | 1) == 3;
	ull A[] = {2, 325, 9375, 28178, 450775, 9780504, 1795265022},
		s = __builtin_ctzll(n-1), d = n >> s;
	for (ull a : A) {   // ^ count trailing zeroes
		ull p = modpow(a%n, d, n), i = s;
		while (p != 1 && p != n - 1 && a % n && i--)
			p = modmul(p, p, n);
		if (p != n-1 && i != s) return 0;
	}
	return 1;
}


ull pollard(ull n) {
	auto f = [n](ull x) { return modmul(x, x, n) + 1; };
	ull x = 0, y = 0, t = 30, prd = 2, i = 1, q;
	while (t++ % 40 || __gcd(prd, n) == 1) {
		if (x == y) x = ++i, y = f(x);
		if ((q = modmul(prd, max(x,y) - min(x,y), n))) prd = q;
		x = f(x), y = f(f(y));
	}
	return __gcd(prd, n);
}

vector<ull> factor(ull n) {
	if (n == 1) return {};
	if (isPrime(n)) return {n};
	ull x = pollard(n);
	auto l = factor(x), r = factor(n / x);
	l.insert(l.end(), all(r));
	return l;
}

signed main(){
	ios::sync_with_stdio(0); cin.tie(0);
	// freopen("input.txt","r",stdin);
	// freopen("output.txt","w",stdout);

	int x;

	cin >> x;

	if (x == 1) {
		cout << 1;
		return 0;
	}

	vector<ull> fact = factor(x);

	sort(fact.begin(), fact.end());

	vector<int> a, b;

	int cnt = 1;

	for (int i = 1 ; i < fact.size() ; i++) {
		if (fact[i] != fact[i-1]) {
			a.push_back(cnt);
			b.push_back(fact[i-1]);
			cnt = 0;
		}
		cnt += 1;
	}

	a.push_back(cnt);
	b.push_back(fact.back());

	int gcd = 0;

	for (int &u: a) {
		gcd = __gcd(u, gcd);
	}

	int res = -1;

	for (int i = 1 ; i <= gcd ; i++) {
		if (gcd % i == 0) {
			int cnt = 1;

			for (int &u: a) {
				cnt *= (u / i + 1);
			}

			if (i == cnt) {
				for (int j = 0 ; j < a.size() ; j++) {
					for (int k = 0 ; k < a[j] / i ; k++) {
						res *= b[j];
					}
				}
				break;
			}
		}
	}
	if (res != -1) res *= -1;
	cout << res;

	return 0;
}