T = int(input())

# k 乗根
def sqrt(n: int, k = 2):
    l = k - 1
    if not n: return 0
    y = 1 << (n.bit_length() + l) // k
    x = y + 1
    while y < x:
        x = y
        y = (l * x + n // (x ** l)) // k
    return x

# n以下の平方数と平方数の2倍数
def f(n):
    a = sqrt(n)
    b = sqrt(n//2)
    return a + b

for i in range(T):
    l, r = map(int, input().split())

    # l ~ r
    # f(r) - f(l - 1)
    X = f(r) - f(l - 1)
    if X%2 == 1:
        print(1)
    else:
        print(0)