#include #define rep(i,n) for(int i=0;i<(int)(n);i++) using namespace std; using ll = long long ; using P = pair ; using pll = pair; constexpr int INF = 1e9; constexpr long long LINF = 1e17; constexpr int MOD = 1000000007; constexpr double PI = 3.14159265358979323846; void solve(){ ll a,p; cin >> a >> p; for(ll i=2;i*i<=p;i++){ if(p%i==0){cout << -1 << endl;return;} } cout << 1 << endl; return; } int main(){ int t; cin >> t; while(t--){ solve(); } return 0; }