#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
typedef long long ll;
const ll mod = 998244353;
int main(){
	ll N; cin >> N;
	if(N == 1){
	  cout << 1 << endl;
	}
	else{
	  ll MAX = 1e6 + 10;
	  vector<ll> prime(MAX, true);
	  prime[0] = prime[1] = false;
	  for(int i = 2; i < MAX; i++){
	    if(prime[i]){
	      for(int j = 2; i * j < MAX; j++){
	        prime[i * j] = false;
	      }
	    }
	  }
	  ll cnt = 0;
	  ll nN = N;
	  for(ll i = 2; i * i <= N; i++){
	    if(prime[i]){
	      if(nN % i == 0){
	        if(prime[i] and (nN % (i * i)) == 0){
	          cout << 0 << endl;
	          return 0;
	        }
	        nN /= i;
	        cnt++;
	      }
	    }
	  }
	  cout << (cnt & 1 ? -1 : 1) << endl;
	}
}