#pragma GCC target("avx2") #pragma GCC optimize("unroll-loops") #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #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 pii; typedef pair pll; 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+05; ll dx[4] = { 0, -1, 0, 1 }, dy[4] = { 1, 0, -1, 0 }; int T; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cin >> T; for (int t = 1; t <= T; ++t) { ll l, r; cin >> l >> r; ll x = r - l + 1; if (x % 2 == 0) { ll y = x / 2; if (y % 2 == 0) { if (y == 2) { cout << 1 << "\n"; } else { cout << 0 << "\n"; } } else { cout << 1 << "\n"; } } else { ll y = (x + 1) / 2; if (y % 2 == 0) { ll z = y / 2; if (z % 2 == 0) { cout << 0 << "\n"; } else { cout << 1 << "\n"; } } else { ll z = y / 2; if (z % 2 == 0) { cout << l + r << "\n"; } else { cout << ((l + r) ^ 1) << "\n"; } } } } // for (int i = 0; i < N; i++) { // for (int j = 0; j < N; j++) { // cout << "i = " << i << ", j = " << j << ", dp = " << dp[i][j] << "\n"; // } // } return 0; }