import sys
#input = sys.stdin.readline
#input = sys.stdin.buffer.readline #文字列はダメ
#sys.setrecursionlimit(1000000)
#import bisect
#import itertools
#import random
#from heapq import heapify, heappop, heappush
#from collections import defaultdict 
#from collections import deque
#import copy
#import math
#from functools import lru_cache
#@lru_cache(maxsize=None)
#MOD = pow(10,9) + 7
#MOD = 998244353
#dx = [1,0,-1,0]
#dy = [0,1,0,-1]
#dx8 = [1,1,0,-1,-1,-1,0,1]
#dy8 = [0,1,1,1,0,-1,-1,-1]
#dx = [1,1,-1,-1]
#dy = [1,-1,1,-1]

#平方数*2^nと書ける形の場合偶数

def main():
    T = int(input())
    for i in range(T):
        L,R = map(int,input().split())
        a = g(R); b = g(L-1)
        #print(R,"G",a)
        #print(L-1,"G",b)
        print((a-b)%2)


#奇数の個数を返す
def g(x):
    ret = 0
    while x > 0:
        temp = int(x**(0.5))
        #2はダブるので奇数のみ。切り上げ
        temp  = (temp + 1) //2
        #print("X",x,"t",temp)
        ret += temp
        x //= 2
    return ret


if __name__ == '__main__':
    main()