/* -*- coding: utf-8 -*-
 *
 * 3692.cc:  No.3692 Calculate Mu - yukicoder
 */

#include<cstdio>
#include<vector>
#include<algorithm>
#include<utility>

using namespace std;

/* constant */

const int MAX_P = 1000000 + 100;

/* typedef */

using ll = long long;
using vb = vector<bool>;
using vi = vector<int>;
using pli = pair<ll,int>;
using vpli = vector<pli>;

/* global variables */

vb primes;
vi pnums;

/* subroutines */

int gen_primes(int maxp) {
  primes.assign(maxp + 1, true);
  primes[0] = primes[1] = false;
  pnums.clear();

  int p;
  for (p = 2; p * p <= maxp; p++)
    if (primes[p]) {
      pnums.push_back(p);
      for (int q = p * p; q <= maxp; q += p) primes[q] = false;
    }
  for (; p <= maxp; p++)
    if (primes[p]) pnums.push_back(p);
  return (int)pnums.size();
}

vpli prime_decomp(ll n) {
  vpli pds;

  for (auto pi: pnums) {
    if ((ll)pi * pi > n) {
      if (n > 1) pds.push_back(pli(n, 1));
      break;
    }

    if (n % pi == 0) {
      int fi = 0;
      while (n % pi == 0) n /= pi, fi++;
      pds.push_back(pli(pi, fi));
    }
  }
  return pds;
}


/* subroutines */

/* main */

int main() {
  ll n;
  scanf("%lld", &n);

  gen_primes(MAX_P);
  auto pds = prime_decomp(n);

  for (auto [p, d]: pds)
    if (d >= 2) { puts("0"); return 0; }

  printf("%d\n", (pds.size() & 1) ? -1 : 1);
  
  return 0;
}