#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

const int mod=1000000007;
const int INF=1001001001;

int f(int P,int Q){

  vector<int>A;
  for(int i=3;i*i<=P;i++){
    int s=P/i;
    if(P%i==0){if(Q%(i-2)==0&& s > Q/(i-2)){A.push_back(i-1);}
               if(i!=s&&Q%(s-2)==0&&P/s>Q/(s-2)){A.push_back(P/i-1);}
    }
  }

  int n=A.size();
  int cnt=0;
  for(int i=0;i<n;i++){
    int v=Q/(A[i]-1);
    int w=P/(A[i]+1);
    int B=(v+w)/2;
    int C=(w-v)/2;
    if((A[i]-1)*(B-C)==Q&&(A[i]+1)*(B+C)==P){cnt++;}
  }
  return cnt;
}

int main() {
  int N;
  cin>>N;
  vector<int>x(N),y(N);
  for(int i=0;i<N;i++){
    cin>>x[i]>>y[i];
  }
  int cnt=0;
  for(int i=0;i<N;i++){
    int P=x[i]+y[i];
    int Q=x[i]-y[i];
    if(y[i]!=x[i]){
      cout<<f(P,Q)<<endl;
    }
    //else {
      //if()
    //}
    
  }
  return 0;  
}