#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
#include <deque>
#include <stack>
#include <sstream>
#include <utility>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
#include <array>
#include <bitset>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}


int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int q; cin >> q;
    while(q--){
        ll L,R; cin >> L >> R;
        auto solve=[](ll p)->ll{
            ll l = 0, r = 2e8;
            ll res = 0;
            while(r-l>1){
                ll mid = (l+r)/2;
                if(mid*mid < p){
                    l = mid;
                }
                else{
                    r = mid;
                }
            }
            res += l;
            l = 0, r = 2e8;
            while(r-l>1){
                ll mid = (l+r)/2;
                if(mid*mid*2 < p){
                    l = mid;
                }
                else{
                    r = mid;
                }
            }
            res += l;
            return res;
        };
        cout << (solve(R+1)-solve(L))%2 << "\n";
    }
}