#include #define rep(i,n) for (int i = 0; i < (n); ++i) #define printVec(v) printf("{"); for (const auto& i : v) { std::cout << i << ", "; } printf("}\n"); #define degreeToRadian(deg) (((deg)/360)*2*M_PI) #define radianTodegree(rad) (((rad)/2/M_PI)*360) template inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } using namespace std; using P = pair; using ll = long long; const ll INF = 1LL<<60; const int MOD = 1e9 + 7; const int dx[4] = {1, 0, -1, 0}; const int dy[4] = {0, 1, 0, -1}; //cin.tie(0);ios::sync_with_stdio(false); //cout << fixed << setprecision(15) << y << endl; bool is_prime(ll a) { if (a < 2) return false; for (int i = 2; i <= sqrt(a); i++) { if (a % i == 0) { return false; } } return true; } int main() { cin.tie(0);ios::sync_with_stdio(false); int t; cin >> t; vector ans; vector pn(1e6 + 5); pn[0] = false, pn[1] = true; for (int i = 2; i < 1e6 + 5; i++) { pn[i] = is_prime(i + 1); } for (int i = 0; i < t; i++) { ll a, p; scanf("%lld %lld", &a, &p); if (pn[p]) { ans.push_back(1); } else { ans.push_back(-1); } } for (auto v : ans) { cout << v << endl; } return 0; }