#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);
    const ll N = 1e15;
    vector<ll> v;
    for(ll i=1;i*i<=N;i++){
        v.push_back(i*i);
        v.push_back(i*i*2);
    }
    sort(v.begin(), v.end());
    int q; cin >> q;
    while(q--){
        ll L,R; cin >> L >> R;
        cout << (lower_bound(v.begin(), v.end(), R+1) - lower_bound(v.begin(), v.end(), L))%2 << "\n";
    }
}