#include <bits/stdc++.h>
using namespace std;
using ll = long long;

void solve() {
    ll X, Y;
    cin >> X >> Y;
    if (X == Y) {
        ll ans = X - 1;
        ll t = 2;
        while (t * t <= X) {
            if (X % t == 0) {
                if (t * t == X) {
                    ans++;
                } else {
                    ans += 2;
                }
            }
            t++;
        }
        if (X > 1) {
            ans += 1;
        }
        cout << ans << endl;
        return;
    }
    if (X < Y) {
        swap(X, Y);
    }

    ll PN = X + Y;
    unordered_map<ll, ll> plus;
    ll t = 1;
    while (t * t <= PN) {
        if (PN % t == 0) {
            plus[t] = PN / t;
            plus[PN / t] = t;
        }
        t++;
    }

    ll MN = X - Y;
    unordered_map<ll, ll> minus;
    t = 1;
    while (t * t <= MN) {
        if (MN % t == 0) {
            minus[t] = MN / t;
            minus[MN / t] = t;
        }
        t++;
    }

    ll ans = 0;
    for (auto itr = minus.begin(); itr != minus.end(); ++itr) {
        ll num = itr->first;
        ll target = itr->second;
        if (plus.find(num + 2) != plus.end()) {
            if ((plus[num + 2] + target) % 2 == 0 && plus[num + 2] > target) {
                ans++;
            }
        }
    }
    cout << ans << endl;
}

int main() {
    ll S;
    cin >> S;
    for (int i = 0; i < S; i++) {
        solve();
    }

    return 0;
}