#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;
#define PI 3.141592653589793

int main(){
  int S; cin >> S;
  while(S--){
    int x, y; cin >> x >> y; int ans = 0;
    if(x<y) swap(x, y);
    int p = x+y; int m = x-y;
    set<pair<int, int>> pl;
    for(int i=1; i*i<=p; i++){
      if(p%i==0){
        pl.insert({i, 0}); pl.insert({p/i, 0});
      }
    }
    for(int i=1; i*i<=m; i++){
      if(m%i==0){
        pl.insert({i, 1}); pl.insert({m/i, 1});
      }
    }
    for(auto k: pl){
      if(k.second==1){
        if(pl.count({k.first+2, 0})){
          if((p/(k.first+2))%2==(m/k.first)%2 && p/(k.first+2)>(m/k.first)){
            ans++; //cout << k.first << " " << p << " " << m << endl;
          }
        }
      }
    }
    cout << ans << endl;
  }
}