#include <bits/stdc++.h>
//#include <chrono>
//#pragma GCC optimize("Ofast")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;

ll N,M,H,W,Q,K,A,B;
string S;
typedef pair<ll, ll> P;
const ll INF = (1LL<<58);

void make_d(ll a, vec &res){
    for(ll i = 1; i * i <= a; ++i){
        if(a%i == 0){
            res.push_back(i);
            if(i * i != a) res.push_back(a/i);
        }
    }
}

int main() {
    cin>>Q;
    ll X, Y;
    rep(_, Q){
        scanf("%lld%lld", &X, &Y);
        if(X < Y) swap(X, Y);
        ll res(0), bpc, bmc;
        vec d(0);
        make_d(X + Y, d);
        for(ll a1 : d){
            if(a1 == 1) continue;
            if(a1 == 2){
                if(X == Y){
                    res += (X + Y) / 2 - 1;
                }
            }else if((X - Y)%(a1 - 2) == 0){
                bpc = (X + Y) / a1;
                bmc = (X - Y) / (a1 - 2);
                res += (bpc >= bmc + 2 && (bpc&1) == (bmc&1));
            }
        }
        printf("%lld\n", res);
    }
}