#pragma GCC target("avx2")
#pragma GCC optimize("unroll-loops")

#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define ALL(x) (x).begin(), (x).end()
#define PC(x) __builtin_popcount(x)
#define PCL(x) __builtin_popcountll(x)

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, pii> plii;
struct edge {
    int to, cost, id;
};
const double PI = 3.14159265358979323846;
const double PI2 = PI * 2.0;
const double EPS = 1E-09;
const ll MOD = 1E+09 + 7; // =998244353;
const ll INFL = 1E18;
const int INFI = 1E09;
const int MAX_N = 1E+04;

ll dx[4] = { -1, 1, 0, 0 }, dy[4] = { 0, 0, -1, 1 };

int T;

ll L[MAX_N + 1], R[MAX_N + 1];

ll solve(ll r)
{
    ll res = 0;
    ll low = 0, high = 1E08;
    while (high - low > 1) {
        ll mid = (low + high) / 2;
        if (mid * mid <= r)
            low = mid;
        else
            high = mid;
    }
    res += low;
    low = 0, high = 1E08;
    while (high - low > 1) {
        ll mid = (low + high) / 2;
        if (2 * mid * mid <= r)
            low = mid;
        else
            high = mid;
    }
    res += low;
    return res;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> T;

    for (int i = 1; i <= T; ++i) {
        cin >> L[i] >> R[i];
    }

    // for (int i = 0; i < N; i++) {
    //     for (int j = 0; j < N; j++) {
    //         cout << "i = " << i << ", j = " << j << ", dp = " << dp[i][j] << "\n";
    //     }
    // }

    for (int i = 1; i <= T; ++i) {
        cout << (solve(R[i]) - solve(L[i] - 1)) % 2 << "\n";
    }

    return 0;
}