#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;

#define pb push_back

const ld pi = 3.14159265358979323846;
// const int mod = 998244353;
const ll INF = 1e18;

template<typename T>
T chmax(T a, T b) {
    return a > b ? a : b;
}

template<typename T>
T chmin(T a, T b) {
    return a > b ? b : a;
}

const int N = (int)2e5 + 1, M = N * 2;

ll qpow(ll a, ll b){
    ll res = 1;    
    
    while(b > 0){
        if(b % 2 == 1){
            res = (res * a); 
        }
        a = (a * a); 
        b /= 2;  
    }
    return res;
}

void solve(){
    ll x;
    cin >> x;

    auto f = [&](ll t) -> ll{      
        ll qwq = 0;  
        for(ll i = 1; i * i <= t; i++){
            if(t % i == 0){
                qwq++;
                if(t / i != i){
                    qwq++;
                }
            }
        }
        return qwq;
    };

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

    for(int i = (x >= 1e14 ? 3 : 2); i <= 64; i++){
        ll t = (ll)pow(x, 1.0 / i);
        if(qpow(t + 1, i) == x && f(t + 1) == i){
            cout << t + 1 << endl;
            return;
        }
        if(qpow(t, i) == x && f(t) == i){
            cout << t << endl;
            return;
        }
    }
    cout << -1 << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int t = 1;
//    cin >> t;

    while(t--){
        solve();
    }

    return 0;
}