//g++ 1.cpp -std=c++14 -O2 -I .
#include <bits/stdc++.h>
using namespace std;

#include <atcoder/math>
#include <atcoder/modint>
using namespace atcoder;

using ll = long long;
using ld = long double;

using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vst = vector<string>;
using vvst = vector<vst>;

#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define pq_big(T) priority_queue<T,vector<T>,less<T>>
#define pq_small(T) priority_queue<T,vector<T>,greater<T>>
#define all(a) a.begin(),a.end()
#define rep(i,start,end) for(ll i=start;i<(ll)(end);i++)
#define per(i,start,end) for(ll i=start;i>=(ll)(end);i--)
#define uniq(a) sort(all(a));a.erase(unique(all(a)),a.end())

// [a,b]
ll sub(ll a,ll b){
  if(a>b)return 0;

  if(a==b){
    while(a%2==0)a/=2;
    ll sq=sqrt(a);
    rep(i,sq-10,sq+10){
      if(i*i==a){
        return 1;
      }
    }
    return 0;
  }


  ll mineven=a+a%2;
  ll maxeven=b-b%2;
  mineven/=2,maxeven/=2;
  ll res=sub(mineven,maxeven);

  ll p=sqrt(a);
  p+=10;
  while(true){
    if(p*p<a){
      p++;
      break;
    }
    p--;
  }

  ll q=sqrt(b);
  q+=10;
  while(true){
    if(q*q<=b){
      break;
    }
    q--;
  }

  /*
  p以上q以下奇数いくつ
  p+1以上q+1以下偶数いくつ
  */

  res+=(q+1)/2-p/2;
  return res%2;
}

void solve(){
  /*
  /=2をしまくる
  平方数の時 -> 奇数
  そうでない時 -> 偶数
  */

  ll l,r;
  cin>>l>>r;
  cout<<sub(l,r)<<endl;
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int t;
  cin>>t;

  while(t--){
    solve();
  }
}