#include using namespace std; // Define using ll = long long; using ull = unsigned long long; using ld = long double; template using pvector = vector>; template using rpriority_queue = priority_queue, greater>; constexpr const ll dx[4] = {1, 0, -1, 0}; constexpr const ll dy[4] = {0, 1, 0, -1}; constexpr const ll MOD = 1e9 + 7; constexpr const ll mod = 998244353; constexpr const ll INF = 1LL << 60; constexpr const ll inf = 1 << 30; constexpr const char rt = '\n'; constexpr const char sp = ' '; #define rt(i, n) (i == (ll)(n) -1 ? rt : sp) #define len(x) ((ll)(x).size()) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #define mp make_pair #define mt make_tuple #define pb push_back #define eb emplace_back #define ifn(x) if (not(x)) #define elif else if #define elifn else ifn #define fi first #define se second #define uniq(x) (sort(all(x)), (x).erase(unique(all(x)), (x).end())) using graph = vector>; template using wgraph = vector>; bool __DIRECTED__ = true; istream &operator>>(istream &is, graph &g) { ll a, b; is >> a >> b; g[a - 1].pb(b - 1); if (__DIRECTED__ == false) g[b - 1].pb(a - 1); return is; } template istream &operator>>(istream &is, wgraph &g) { ll a, b; T c; is >> a >> b >> c; g[a - 1].pb({b - 1, c}); if (__DIRECTED__ == false) g[b - 1].pb({a - 1, c}); return is; } template bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; } template bool chmin(T &a, const T &b) { if (a > b) { a = b; return 1; } return 0; } // Debug #define debug(...) \ { \ cerr << __LINE__ << ": " << #__VA_ARGS__ << " = "; \ for (auto &&X : {__VA_ARGS__}) cerr << "[" << X << "] "; \ cerr << rt; \ } #define dump(a, h, w) \ { \ cerr << __LINE__ << ": " << #a << " = [" << rt; \ rep(_i, h) { \ rep(_j, w) { \ if (abs(a[_i][_j]) >= INF / 2 and a[_i][_j] <= -INF / 2) \ cerr << '-'; \ if (abs(a[_i][_j]) >= INF / 2) \ cerr << "∞" << sp; \ else \ cerr << a[_i][_j] << sp; \ } \ cerr << rt; \ } \ cerr << "]" << rt; \ } #define vdump(a, n) \ { \ cerr << __LINE__ << ": " << #a << " = ["; \ rep(_i, n) { \ if (_i) cerr << sp; \ if (abs(a[_i]) >= INF / 2 and a[_i] <= -INF / 2) cerr << '-'; \ if (abs(a[_i]) >= INF / 2) \ cerr << "∞" << sp; \ else \ cerr << a[_i]; \ } \ cerr << "]" << rt; \ } // Loop #define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i) #define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i) #define rep(i, n) for (ll i = 0, _##i = (n); i < _##i; ++i) #define each(i, a) for (auto &&i : a) // Stream #define fout(n) cout << fixed << setprecision(n) struct io { io() { cin.tie(nullptr), ios::sync_with_stdio(false); } } io; // Speed #pragma GCC optimize("Ofast,unroll-loops") #pragma GCC target( \ "sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native,arch=skylake-avx512") // Math inline constexpr ll gcd(const ll a, const ll b) { return b ? gcd(b, a % b) : a; } inline constexpr ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; } inline constexpr ll modulo(const ll n, const ll m = MOD) { ll k = n % m; return k + m * (k < 0); } inline constexpr ll chmod(ll &n, const ll m = MOD) { n %= m; return n += m * (n < 0); } inline constexpr ll mpow(ll a, ll n, const ll m = MOD) { ll r = 1; rep(i, 64) { if (n & (1LL << i)) r *= a; chmod(r, m); a *= a; chmod(a, m); } return r; } inline ll inv(const ll n, const ll m = MOD) { ll a = n, b = m, x = 1, y = 0; while (b) { ll t = a / b; a -= t * b; swap(a, b); x -= t * y; swap(x, y); } return modulo(x, m); } struct fact { ll N; vector A, B, C; fact(ll n = 1 << 20) : N(n), A(n + 1, 1), B(n + 1), C(n + 1, 1) { A[0] = A[1] = C[0] = C[1] = 0; inc(i, 2, N) { if (A[i] == 1) { for (ll k = 2 * i; k <= N; k += i) { A[k] = 0; B[k] = i; } } else { C[i] = C[i / B[i]] + 1; } } } bool p(ll n) { return A[n]; } ll mf(ll n) { return B[n]; } ll sf(ll n) { return C[n]; } } f(5000000); signed main() { ll T; cin >> T; rep(i, T) { ll A, P; cin >> A >> P; if (f.A[P] and mpow(A, 3 * P, P) == 0) { cout << 0 << rt; } else if (f.A[P]) { cout << 1 << rt; } else { cout << -1 << rt; } } }