#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)

using namespace std;
using ll = long long;
using P = pair<ll, int>;

vector<P> factorize(ll n) {
    vector<P> res;
    for (ll i = 2; i*i <= n; ++i) {
        if (n%i != 0) continue;
        res.emplace_back(i, 0);
        while (n%i == 0) {
            n /= i;
            res.back().second++;
        }
    }
    if (n != 1) res.emplace_back(n, 1);
    return res;
}

int main() {
    ll n;
    cin >> n;
    
    if (n == 1) {
        cout << 1 << '\n';
        return 0;
    }
    
    auto fs = factorize(n);
    
    int k = 0;
    for (auto p : fs) {
        if (p.second > 1) {
            cout << 0 << '\n';
            return 0;
        }
        k++;
    }
    
    if (k&1) cout << -1 << '\n';
    else cout << 1 << '\n';
    
    return 0;
}