#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
  #include "settings/debug.cpp"
#else
  #define Debug(...) void(0)
#endif
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using ull = unsigned long long;

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  constexpr int n = 5'000'000;
  bitset<n + 1> is_prime;
  is_prime.flip();
  is_prime.reset(0), is_prime.reset(1);
  for (int i = 2; i * i <= n; ++i) {
    if (is_prime.test(i)) {
      for (int j = i * i; j <= n; j += i) is_prime.reset(j);
    }
  }
  int t;
  cin >> t;
  while (t--) {
    ll a, p;
    cin >> a >> p;
    if (is_prime.test(p)) {
      cout << (gcd(a, p) == 1 ? 1 : 0) << '\n';
    }
    else {
      cout << -1 << '\n';
    }
  }
  return 0;
}