#include <bits/stdc++.h>
#define rep(i, l, r) for (int i = (l); i < (r); i++)
using namespace std;

typedef long long ll;

int N;

int f(int x) {
    while (x > N - 1) {
        int a = 1;
        while (a * 2 <= x) a *= 2;
        x -= a;
    }
    return x + 1;
}

int main() {
    cin >> N;
    rep(i, 0, N) {
        cout << f(i * 2) << " " << f(i * 2 + 1) << endl;
    }
}
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
const ll mod = 1e9+7;
const ll mod2 = 998244353;
const ld eps = 1e-10;
template<typename T1, typename T2> inline void chmin(T1 &a, T2 b){if(a>b) a=b;}
template<typename T1, typename T2> inline void chmax(T1 &a, T2 b){if(a<b) a=b;}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int t; cin >> t;
  rep(_, t) {
    ll l, r; cin >> l >> r;
    if(2*l > r) cout << 0 << endk;
    else cout << (-2*l+1)*(r-2*l+1) + r*(r+1)/2 - (2*l-1)*(2*l)/2 << endk;
  }
  return 0;
}
