def count(x):
    if x == 0:
        return 0
    return (int(x**0.5)+1)//2+count(x//2)


def solve(l, r):
    return (count(r)-count(l-1)) % 2


T = int(input())
ans = []
for _ in range(T):
    L, R = map(int, input().split())
    ans.append(solve(L, R))

print(*ans, sep='\n')