#include <bits/stdc++.h>

using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define rrep(i,n) for(int i=n-1;i>=0;--i)
#define debug(output) if(debugFlag)cout<<#output<<"= "<<output<<"\n";
using lint = long long;
typedef pair<int,int> P;
const bool debugFlag=true;
const lint linf=1.1e18;const int inf=1.01e9;
constexpr int MOD=1000000007;
template<class T>bool chmax(T &a, const T &b) { if(a < b){ a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if(a > b){ a = b; return 1; } return 0; }

using ull=unsigned long long;
int check(ull x,int a,ull y){
  ull s=1;
  while(a--){
    if(s<=ULLONG_MAX/x)s*=x;
    else return 0;
  }
  return s<=y;
}
ull introot(ull x,int a){
  if(a==1)return x;
  ull y=pow(x,1.0/a);
  y--;
  while(check(y+1,a,x))y++;
  return y;
}
ull getroot (ull x,int a){
    return introot(x,a);
}

void solve(){
  lint l,r;cin>>l>>r;
  int R=getroot(r,2)+getroot(r/2,2);
  int L=getroot(l-1,2)+getroot((l-1)/2,2);
  cout<<(R-L)%2<<"\n";
}

signed main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  int t;cin>>t;
  rep(i,t)solve();
  return 0;
}