#include <stdio.h>

long long solve(long long L, long long R)
{
	long long ans = 0, l[2], r[2], m, b, LL, RR;
	for (b = 1; b <= R; b <<= 1) {
		LL = (L + b - 1) / b;
		RR = R / b;
		l[0] = 0;
		r[0] = 1 << 25;
		while (l[0] < r[0]) {
			m = (l[0] + r[0]) / 2;
			if (m * m >= LL) r[0] = m;
			else l[0] = m + 1;
		}
		l[1] = 0;
		r[1] = 1 << 25;
		while (l[1] < r[1]) {
			m = (l[1] + r[1] + 1) / 2;
			if (m * m <= RR) l[1] = m;
			else r[1] = m - 1;
		}
		if (l[0] % 2 == 0) l[0]++;
		if (l[1] % 2 == 0) l[1]--;
		if (l[0] <= l[1]) ans += (l[1] - l[0]) / 2 + 1;
	}
	return ans;
}

int main()
{
	int i, t, T;
	long long L, R;
	scanf("%d", &T);
	for (t = 1; t <= T; t++) {
		scanf("%lld %lld", &L, &R);
		printf("%lld\n", solve(L, R) % 2);
	}
	fflush(stdout);
	return 0;
}