#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const ll MOD = 1000000007;
//const ll MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
const double pi = acos(-1.0);
const double EPS = 1e-10;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

int main(){
    int T;
    cin >> T;
    while(T--){
        int X, Y;
        cin >> X >> Y;
        if(X < Y) swap(X, Y);
        int N = X+Y, M = X-Y;
        int ans = 0;
        if(X == Y) ans += X-1;
        for(int i = 1; i*i <= N; i++){
            if(N%i != 0) continue;
            int p = i, q = N/i;
            if(q > 2){
                if(M%(q-2) == 0){
                    int r = M/(q-2);
                    if((p+r)%2 == 0 && p > r) ans++;
                }
            }
            if(p == q) continue;
            swap(p, q);
            if(q > 2){
                if(M%(q-2) == 0){
                    int r = M/(q-2);
                    if((p+r)%2 == 0 && p > r) ans++;
                }
            }
        }
        cout << ans << endl;
    }
}