#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<set>
#include<numeric>
#include<iomanip>
#include<map>
#include<stack>
#include<queue>
#include<tuple>
#include<utility>
#include<deque>
#include<functional>
using namespace std;
using ll = long long;
#define el '\n'
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,l,n) for(int i=l;i<n;i++)
#define all(v) v.begin(),v.end()

template<int MOD>
struct modint{
    ll x;
    modint(ll v=0){x=v%MOD;if(x<0)x+=MOD;}
    modint operator+(const modint&a)const{return modint(x+a.x);}
    modint operator-(const modint&a)const{return modint(x-a.x);}
    modint operator*(const modint&a)const{return modint(x*a.x);}
    modint& operator*=(const modint&a){x=x*a.x%MOD;return *this;}
    modint& operator+=(const modint&a){if((x+=a.x)>=MOD)x-=MOD;return *this;}
    modint& operator-=(const modint&a){x-=a.x;if(x<0)x+=MOD;return *this;}
    modint pow(ll n)const{modint res=1;modint a = *this;while(n){if(n&1)res=res*a;a=a*a;n>>=1;}return res;}
    modint inv()const{return pow(MOD-2);}
    modint operator/(const modint &a)const{return *this*a.inv();}
    modint& operator/=(const modint &a){return *this*=a.inv();}
    bool operator==(const modint&a)const{return x==a.x;}
    bool operator!=(const modint&a)const{return x!=a.x;}
    ll val()const{return x;}
};
using mint=modint<998244353>;

struct sieve{
    vector<ll> f;vector<ll> primes;
    sieve(ll n=2){f.resize(n+1,0);f[0]=f[1]=-1;
        for(ll i=2;i<=n;i++){if(f[i])continue;primes.push_back(i);f[i]=i;
            for(ll j=i*i;j<=n;j+=i){if(f[j])continue;f[j]=i;}}}
    bool is_prime(ll x){return f[x]==x;}
    vector<ll> prime_factors(int x){vector<ll> vec;
        while(x!=1){vec.push_back(f[x]);x/=f[x];}return vec;}
    vector<pair<ll,ll>> prime_factorize(ll x){vector<pair<ll,ll>> vec;
        for(ll i=0;i<primes.size();i++){if(x%primes[i])continue;ll exp=0;
            while(!(x%primes[i])){x/=primes[i];exp++;}vec.push_back({primes[i],exp});}return vec;}
    vector<ll> divisors(ll x){vector<ll> res;
        for(ll i=1;i*i<=x;i++){if(x%i==0){res.push_back(i);if(i*i!=x)res.push_back(x/i);}}
        sort(res.begin(),res.end());return res;}
};

int main(){

	ll N;cin >> N;
	sieve p(1000006);
	auto prime = p.primes;
	if(N==1){
		cout << 1 <<el;
	}else{
		ll num=0;
		rep(i,prime.size()){
			if(N%(prime[i]*prime[i])==0){
				cout << 0 << el;
				return 0;
			}
			if(N%prime[i]==0){
				num++;
			}
		}
		cout << (num%2==0?1:-1)<<el;
	}


	return 0;
}