#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, j, n) for (int i = j; i < (n); ++i)
#define rrep(i, j, n) for (int i = (n)-1; j <= i; --i)
#define all(a) a.begin(), a.end()
template <typename T>
std::ostream &operator<<(std::ostream &os, std::vector<T> &a) {
  for (size_t i = 0; i < a.size(); ++i) os << (i > 0 ? " " : "") << a[i];
  return os << '\n';
}
template <typename T>
std::istream &operator>>(std::istream &is, std::vector<T> &a) {
  for (T &x : a) { is >> x; }
  return is;
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int t;
  cin >> t;
  while (t--) {
    ll l, r;
    cin >> l >> r;
    // ll ans = 0;
    // for (ll i = l * 2; i <= l + r; i += 4) {
    //   ans ^= i;
    //   if (i + 1 <= l + r) ans ^= i + 1;
    // }
    // cout << ans << '\n';
    ll a = (r - l) / 4 + 1;
    if ((l + r) % 2) {
      cout << a % 2 << '\n';
    } else {
      if ((r - l) % 4 == 0) {
        cout << ((a - 1) % 2 ^ (l + r)) << '\n';
      } else {
        cout << a % 2 << '\n';
      }
    }
  }
  return 0;
}