import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


// Jacobi symbol (a/m)
int jacobi(long a, long m)
in {
  assert(m > 0, "jacobi: m > 0 must hold");
  assert(m & 1, "jacobi: m must be odd");
}
do {
  import core.bitop : bsf;
  import std.algorithm.mutation : swap;
  int s = 1;
  if (a < 0) a = a % m + m;
  for (; m > 1; ) {
    a %= m;
    if (a == 0) return 0;
    const r = bsf(a);
    if ((r & 1) && ((m + 2) & 4)) s = -s;
    a >>= r;
    if (a & m & 2) s = -s;
    swap(a, m);
  }
  return s;
}

void main() {
  debug {
    foreach (p; [2, 3, 5, 7, 11, 13, 17, 19]) {
      foreach (n; 1 .. p) {
        auto as = new int[p];
        foreach (i; 0 .. p) {
          as[i] = (i * n) % p;
        }
        int cnt;
        foreach (i; 1 .. p) foreach (j; i + 1 .. p) {
          if (as[i] > as[j]) {
            ++cnt;
          }
        }
        writeln(p, " ", n, " ", cnt, " ", cnt % 2);
      }
    }
  }
  
  try {
    for (; ; ) {
      const P = readLong();
      const N = readLong();
      
      long ans;
      if (P == 2) {
        ans = 0;
      } else {
        ans = (jacobi(N, P) == -1) ? 1 : 0;
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}