#include <iostream>
#define rep(i, n) for(i = 0; i < n; i++)
#define int long long
using namespace std;

int f(int n) {
	int ok = 0, ng = 1e+8, mid;
	while(ng - ok >= 2) {
		mid = (ok + ng) / 2;
		if (mid * mid > n) ng = mid;
		else ok = mid;
	}
	return ok;
}

int solve(int n) {
	return f(n) + f(n / 2);
}

signed main() {
	int T;
	cin >> T;
	while (T--) {
		int l, r;
		cin >> l >> r;
		cout << (solve(r) - solve(l - 1)) % 2 << endl;
	}
	return 0;
}