import bisect
import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)
U = 10 ** 15 + 10


P = []
Q = []
for i in range(1, U):
    s = i * i
    if s > U:
        break
    P.append(s)
    Q.append(s * 2)
P.reverse()
Q.reverse()
A = []
while P and Q:
    if P[-1] < Q[-1]:
        A.append(P.pop())
    else:
        A.append(Q.pop())
while P:
    A.append(P.pop())
while Q:
    A.append(Q.pop())


T = int(input())
L = []
R = []
for i in range(T):
    l, r = map(int, input().split())
    L.append((l, i))
    R.append((r, i))

L.sort()
R.sort()

X = [0] * T
Y = [0] * T

p = 0
for n, i in L:
    while A[p] < n:
        p += 1
    X[i] = p

p = 0
for n, i in R:
    while A[p] <= n:
        p += 1
    Y[i] = p


for x, y in zip(X, Y):
    print((y - x) % 2)