t = int(input())

def divisor(n):
    sq = n**0.5
    border = int(sq)
    table = []
    bigs = []
    for small in range(1, border+1):
        if n%small == 0:
            table.append(small)
            big = n//small
            bigs.append(big)
    if border == sq:#nが平方数
        bigs.pop()
    table += reversed(bigs)
    return table

for i in range(t):
    ans = 0
    l,r = map(int,input().split())
    for j in range(l,r+1):
        ans += sum(divisor(j))
    print(ans%2)