#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
long long f(long long n) {
	long long ok = 0;
	long long ng = INF;
	while (1 < abs(ok - ng)) {
		long long c = (ng + ok) / 2;
		if (c *c <= n) ok = c;
		else ng = c;
	}
	return ok;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	//平方数orその倍なら約数の総和が奇数
	int t; cin >> t;
	long long ans = 0;
	while (t--) {
		long long l, r; cin >> l >> r;
		l--;
		long long ans = 0;
		ans += f(r) - f(l);
		ans += f(r/2) - f(l/2);
		ans %= 2;
		cout << ans << endl;
	}
	return 0;
}