#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
#include<cstdio>
#include<cstdlib>
using namespace std;

#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
#define MOD 1000000007
//#define MOD 998244353
#define LINF (long long)4e18
#define jck 3.141592

const double EPS = 1e-10;

using ll = long long;
using Pi = pair<int,int>;
using Pl = pair<ll,ll>;

bool is_prime(int n){
    if(n == 1) return false;
    bool ok = true;
    for(int i = 2; i*i <= n; i++){
        if(n%i == 0) ok = false;
    }
    return ok;
}

int main(){
    int t; cin >> t;
    while(t--){
        ll a; cin >> a;
        int p; cin >> p;
        if(!is_prime(p)){
            cout << -1 << "\n";
        }
        else{
            if(a == p) cout << 0 << "\n";
            else cout << 1 << "\n";
        }
    }
}