#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <numeric>
#include <limits.h>
#include <map>
#include <queue>
#include <string.h>
#include <vector>

using namespace std;
typedef long long ll;

const ll MAX_N = 5000010;
bool checked[MAX_N + 1];

class Prime {
public:
  vector<ll> prime_list;

  Prime() {
    memset(checked, false, sizeof(checked));

    for (ll i = 2; i <= MAX_N; ++i) {
      if (!checked[i]) {
        prime_list.push_back(i);

        for (ll j = 2 * i; j <= MAX_N; j += i) {
          checked[j] = true;
        }
      }
    }
  }

  map<ll, int> prime_division(ll n) {
    map<ll, int> res;

    for (ll i = 0; prime_list[i] <= sqrt(n); ++i) {
      ll p = prime_list[i];

      while (n % p == 0) {
        ++res[p];
        n /= p;
      }
    }

    if (n != 1) {
      res[n] = 1;
    }

    return res;
  }

  bool is_prime(ll n) {
    if (n <= 1) return false;

    return not checked[n];
  }
};

int main() {
  int T;
  cin >> T;

  Prime prime;
  map<ll, bool> memo;

  for (int i = 0; i < T; ++i) {
    ll A, P;
    cin >> A >> P;

    if (not memo.count(P)) {
      memo[P] = prime.is_prime(P);
    }

    if (memo[P]) {
      if (gcd(A, P) == 1) {
        cout << 1 << endl;
      } else {
        cout << 0 << endl;
      }
    } else {
      cout << -1 << endl;
    }
  }

  return 0;
}