#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

// https://oeis.org/A028982
// https://oeis.org/A071860
ll f(ll n) {
  if (n <= 0) return 0;
  ll ans = 0;
  {
    ll lb = 1, ub = min(n, 100000000LL) + 1;
    while (ub - lb > 1) {
      const ll mid = (lb + ub) / 2;
      (mid * mid <= n ? lb : ub) = mid;
    }
    ans += lb;
  }
  if (n >= 2) {
    ll lb = 1, ub = min(n, 100000000LL) + 1;
    while (ub - lb > 1) {
      const ll mid = (lb + ub) / 2;
      (2 * mid * mid <= n ? lb : ub) = mid;
    }
    ans += lb;
  }
  return ans;
}

void solve() {
  ll l, r; cin >> l >> r;
  cout << ((f(r) - f(l - 1)) & 1) << '\n';
}

int main() {
  int t; cin >> t;
  while (t--) solve();
  return 0;
}