#include <bits/stdc++.h>
using namespace std;
template <class F> class y_combinator {
    F f;

   public:
    y_combinator(F&& f) : f(std::forward<F>(f)) {}
    template <class... Args> auto operator()(Args&&... args) const { return f(*this, std::forward<Args>(args)...); }
};
using ll = long long;
using ld = long double;
template <class T, class U = std::less<T>> using prique = std::priority_queue<T, std::vector<T>, U>;
template <class T> T floor(T a, T b) noexcept { return a / b - (a % b && (a ^ b) < 0); }
template <class T> T ceil(T a, T b) noexcept { return floor(a + b - 1, b); }
template <class T> bool chmin(T& x, const T& y) noexcept { return (x > y ? x = y, true : false); }
template <class T> bool chmax(T& x, const T& y) noexcept { return (x < y ? x = y, true : false); }
#define overload4(a, b, c, d, e, ...) e
#define rep1(a) for (long long _i = 0; _i < (a); _i++)
#define rep2(i, a) for (long long i = 0; i < (a); i++)
#define rep3(i, a, b) for (long long i = (a); i < (b); i++)
#define rep4(i, a, b, c) for (long long i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(i, a, b, c) for (long long i = (a); i > (b); i += (c))
#define all(x) std::begin(x), std::end(x)
#define rall(x) std::rbegin(x), std::rend(x)
#define pb push_back
#ifndef LOCAL
#define debug(...)
#endif

std::vector<long long> divisors(long long x) {
    std::vector<long long> ret;
    for (long long d = 1; d * d <= x; d++) if (x % d == 0) ret.push_back(d);
    for (int i = ret.size() - (ret.back() * ret.back() == x); i--;) ret.push_back(x / ret[i]);
    return ret;
}

int main() {
    int tt;
    cin >> tt;
    rep(tt) {
        int x, y;
        cin >> x >> y;
        if (x < y) swap(x, y);
        int P = x + y;
        int Q = x - y;
        auto DP = divisors(P);
        auto DQ = divisors(Q);
        set<int> st(all(DQ));
        int ans = 0;
        for (int d : DP) {
            if(st.count(d - 2)) {
                int a = P / d;
                int b = Q / (d - 2);
                if(a > b && a % 2 == b % 2) ans += 1;
            }
        }
        cout << ans << "\n";
    }
}