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

using ll = long long;
#define int ll
#define all(v) (v).begin(), (v).end()
#define pb push_back

void dbg_out() { cerr << endl; }
template<typename H, typename... T> 
void dbg_out(H h, T... t) { cerr << ' ' << h; dbg_out(t...); }
#define dbg(...) { cerr << #__VA_ARGS__ << ':'; dbg_out(__VA_ARGS__); }

ll mul(ll a, ll b, ll m){
	ll ret = a*b-ll((long double)1/m*a*b+0.5)*m;
	return ret < 0 ? ret+m : ret;
}
ll pow(ll x, ll y, ll m){
	if(!y) return 1;
	ll ans = pow(mul(x,x,m), y/2,m);
	return y%2 ? mul(x,ans,m) : ans;
}

bool prime(ll n){
	if(n < 2) return 0;
	if(n <= 3) return 1;
	if(n%2 == 0) return 0;

	ll r = __builtin_ctzll(n-1), d = n>>r;
	for(int a : {2,325,937,28178,450775,9780504,795265022}){
		ll x = pow(a,d,n);
		if(x == 1 or x == n-1 or a%n == 0) continue;
		for(int j = 0; j < r-1; j++){
			x = mul(x,x,n);
			if(x == n-1) break;
		}
		if(x != n-1) return 0;
	}
	return 1;
}

ll rho(ll n){
	if(n == 1 or prime(n)) return n;
	auto f = [n](ll x){ return mul(x,x,n)+1;};
	ll x=0, y=0, t=30, prd=2,x0=1,q;
	while(t%40 != 0 or gcd(prd,n) == 1){
		if(x==y) x = ++x0, y=f(x);
		q = mul(prd,abs(x-y),n);
		if(q != 0) prd = q;
		x = f(x), y = f(f(y)), t++;
	}
	return gcd(prd,n);
}

vector<ll> fact(ll n){
	if(n == 1) return {};
	if(prime(n)) return {n};
	ll d = rho(n);
	vector<ll> l = fact(d), r = fact(n/d);
	l.insert(l.end(), r.begin(), r.end());
	return l;
}

void solve() {
	ll x;
	cin >> x;
	auto f = fact(x);
	map<ll,int> cnt;
	for(auto y : f){
		cnt[y]++;
	}
	for(int i = 70; i >= 1; i--){
		bool serve = true;
		for(auto [a,b] : cnt){
			serve &= b%i == 0;
		}
		if(!serve) continue;
		ll div = 1;
		ll eu = 1;
		for(auto [a,b] : cnt){
			ll d = b/i;
			div *= d+1;
			for(int k = 0; k < d; k++) eu *= a;
		}
		if(div == i){
			cout << eu << '\n';
			return;
		}
	}
	cout << -1 << '\n';
	
}


signed main() {
    ios::sync_with_stdio(false); cin.tie(0);
    int t=1;
	//cin >> t;
    while(t--)
        solve();
}