//#pragma GCC target("avx2,avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//#include <atcoder/all>
//using namespace atcoder;
//using mint = modint998244353;
//using mint = modint1000000007;
#include <bits/stdc++.h>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//using i128 = __int128_t;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
constexpr char ln = '\n';
template<class T1, class T2> inline bool chmax(T1 &a, T2 b) {if (a < b) {a = b; return true;} return false;}
template<class T1, class T2> inline bool chmin(T1 &a, T2 b) {if (a > b) {a = b; return true;} return false;}
inline int topbit(int x) {return x == 0 ? -1 : 31-__builtin_clz(x);}
inline int topbit(long long x) {return x == 0 ? -1 : 63-__builtin_clzll(x);}
inline int botbit(int x) {return x == 0 ? 32 : __builtin_ctz(x);}
inline int botbit(long long x) {return x == 0 ? 64 : __builtin_ctzll(x);}
inline int popcount(int x) {return __builtin_popcount(x);}
inline int popcount(long long x) {return __builtin_popcountll(x);}
inline int kthbit(long long x, int k) {return (x>>k)&1;}
inline void print() {cout << "\n";}
template<class T>
inline void print(const vector<T> &v) {
    for (auto itr = v.begin(); itr != v.end(); ++itr) cout << *itr << " ";
    print();
}
template<class T, class... Args>
inline void print(const T &x, const Args &... args) {
    cout << x << " ";
    print(args...);
}
#ifdef MINATO_LOCAL
#define dump(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl;
inline void debug() {cerr << endl;}
template<class T>
inline void debug(const vector<T> &v) {
    for (auto itr = v.begin(); itr != v.end(); ++itr) cerr << *itr << " ";
    debug();
}
template<class T, class... Args>
inline void debug(const T &x, const Args &... args) {
    cerr << x << " ";
    debug(args...);
}
#else
#define dump(x) void(0)
inline void debug() {}
template<class T> inline void debug(const vector<T> &v) {}
template<class T, class... Args> inline void debug(const T &x, const Args &... args) {}
#endif
struct Fast_ios {Fast_ios() {cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20);};} fast_ios;
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

template<class Int>
vector<Int> divisor(Int x) {
    assert(x);
    vector<Int> ret;
    for (Int i = 1; i*i <= x; i++) {
        if (x%i==0) {
            ret.emplace_back(i);
            ret.emplace_back(x/i);
        }
    }
    sort(ret.begin(),ret.end());
    ret.erase(unique(begin(ret), end(ret)), end(ret));
    return ret;
}

void solve() {
    int X,Y; cin >> X >> Y;
    if (X==Y) {
        int ans = X-1;
        auto A = divisor(X);
        ans += int(A.size()) - 1;
        if (~X&1) ans--;
        cout << ans << ln;
        return;
    }
    if (X < Y) swap(X,Y);
    auto A = divisor(X+Y);
    auto B = divisor(X-Y);
    set<int> dic;
    for (auto i : B) dic.emplace(i);
    int ans = 0;
    for (auto x : A) {
        ll y = (X+Y)/x;
        if (dic.count(x-2)) {
            ll z = (X-Y)/(x-2);
            if ((y&1)^(z&1)) continue;
            ll b = (y+z)/2;
            ll c = (y-z)/2;
            if (b > 0 and c > 0) ans++;
        }
    }
    cout << ans << ln; 
}

int main() {
    int Q; cin >> Q;
    while (Q--) {
        solve();
    }
}