#include <bits/stdc++.h>
using namespace std;

template <class T, class F = multiplies<T>>
T power(T a, long long n, F op = multiplies<T>(), T e = {1}) {
  assert(n >= 0);
  while (n) {
    if (n & 1) e = op(e, a);
    if (n >>= 1) a = op(a, a);
  }
  return e;
}

unsigned mod = 2;
struct mint {
  using m = mint;
  unsigned v;
  mint(long long a = 0) : v((a %= mod) < 0 ? a + mod : a) {}
  m operator-() const { return m() -= *this; }
  m& operator+=(m r) { if ((v += r.v) >= mod) v -= mod; return *this; }
  m& operator-=(m r) { if (v < r.v) v += mod; v -= r.v; return *this; }
  m& operator*=(m r) { v = (uint64_t)v * r.v % mod; return *this; }
  m& operator/=(m r) { return *this *= power(r, mod - 2); }
  friend m operator+(m l, m r) { return l += r; }
  friend m operator-(m l, m r) { return l -= r; }
  friend m operator*(m l, m r) { return l *= r; }
  friend m operator/(m l, m r) { return l /= r; }
  friend bool operator==(m l, m r) { return l.v == r.v; }
};

template <class Z> map<Z, int> factorize(Z n) {
  map<Z, int> res;
  for (Z i = 2; i * i <= n; ++i) while (n % i == 0) ++res[i], n /= i;
  if (n != 1) ++res[n];
  return res;
}

int mod_log(mint g, mint x) {
  int m = ceil(sqrt(mod - 1));
  map<int, int> mp;
  mint a = 1;
  for (int j = 0; j < m; ++j) {
    mp[a.v] = j;
    a *= g;
  }
  g = 1 / power(g, m), a = 1;
  for (int i = 0; i < (mod - 1 + m - 1) / m; ++i) {
    if (mp.count((a * x).v)) {
      return i * m + mp[(a * x).v];
    }
    a *= g;
  }
  return -1;
}

int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  int p, n;
  cin >> p >> n;
  auto mp = factorize(p - 1);
  mod = p;
  for (int g = 1; ; ++g) {
    bool ok = true;
    for (auto e : mp) {
      if (power(mint(g), (p - 1) / e.first) == 1) {
        ok = false;
        break;
      }
    }
    if (ok) {
      cout << (mod_log(g, n) & 1) << '\n';
      exit(0);
    }
  }
}