#include <bits/stdc++.h>
using namespace std;

int main() {
    vector<long long>tmp;
    for(long long i = 1; i*i <= 1000000000000000; i += 2) {
        long long j = i*i;
        while (j <= 1000000000000000) {
            tmp.push_back(j);
            j *= 2;
        }
    }
    sort(tmp.begin(),tmp.end());
    int t;
    cin >> t;
    while (t--) {
        long long l,r;
        cin >> l >> r;
        cout << (upper_bound(tmp.begin(),tmp.end(),r)-lower_bound(tmp.begin(),tmp.end(),l))%2 << endl;
    }
}