#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <random>
#include <stdio.h>
#include <fstream>
#include <functional>
#include <atcoder/all>
#include "testlib.h"
#include <cassert>
using namespace std;
using namespace atcoder;

#define rep(i,n,c) for (int i=0;i<n;i+=c)
#define append push_back
#define all(x) (x).begin(), (x).end()

template<class T>
using vec = vector<T>;
template<class T>
using vvec = vec<vec<T>>;
template<class T>
using vvvec = vec<vvec<T>>;
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;


template<class T>
bool chmin(T &a, T b){
  if (a>b){
    a = b;
    return true;
  }
  return false;
}

template<class T>
bool chmax(T &a, T b){
  if (a<b){
    a = b;
    return true;
  }
  return false;
}

template<class T>
T sum(vec<T> x){
  T res=0;
  for (auto e:x){
    res += e;
  }
  return res;
}

template<class T>
void printv(vec<T> x){
  for (auto e:x){
    cout<<e<<" ";
  }
  cout<<"\n";
}


const ll INF = 1e17;

const ll MIN_L = 0;
const ll MAX_L = 1ll<<50;
const ll MIN_R = 0;
const ll MAX_R = 1ll<<50;

int main(int argc, char* argv[]){
  registerValidation(argc,argv);
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);

  int t;
  t = inf.readInt(1,100000,"t");
  inf.readEoln();
  ll L,R;
  while (t--){
    L = inf.readLong(MIN_L,MAX_L);
    inf.readSpace();
    R = inf.readLong(L,MAX_R);
    inf.readEoln();

    if ((L+R)%2==1){
      ll cnt = (R-L+1)/2;
      if (cnt%4==1 or cnt%4==2){
        cout<<1<<endl;
      }
      else{
        cout<<0<<endl;
      }
    }
    else{
      ll cnt = (R-L)/2;
      if (cnt%4==1 or cnt%4==2){
        cnt = 1;
      }
      else{
        cnt = 0;
      }
      ll val = (L+R)/2-L+1;
      if (val%2==1){
        cnt ^= L+R;
        cout<<cnt<<endl;
      }
      else{
        cout<<cnt<<endl;
      }
    }
  }
  inf.readEof();

  

}