#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=100005;
int n;
int l[N],r[N];
int lw[N],rw[N];
int ans,minl;
int ansr;
void w(int x){
	for(int i=36;i>=0;i--){
		if(pow(2,i)<=r[x]){
			rw[x]=i;break;
		}
	}
	for(int i=36;i>=0;i--){
		if(pow(2,i)<=l[x]){
			lw[x]=i;break;
		}
	}
}
void solve(){
	cin>>n;
	minl=1e10+10;
	for(int i=1;i<=n;i++){
		cin>>l[i]>>r[i];
		w(i);
	} 
	vector<int> nums;
	for(int i=1;i<=n;i++){
		if(r[i]<minl){
			minl=r[i];ansr=rw[i];
		}
	}        
	for(int i=1;i<=n;i++){
		if(rw[i]==lw[i]||rw[i]==ansr) {
			nums.emplace_back(i);
		}
	}       
	int ans=minl;
	
	for(int i=0;i<nums.size();i++){
		int p=ans;
		int k=l[nums[i]]&p,f=0;
		if(r[nums[i]]-pow(2,rw[nums[i]])>=ans&&l[nums[i]]-pow(2,rw[nums[i]])<=ans)continue;   
		while(r[nums[i]]>ans&&l[nums[i]]>ans){
			r[nums[i]]-=pow(2,rw[nums[i]]);
			l[nums[i]]-=pow(2,lw[nums[i]]);
			w(nums[i]);
		}
		for(int j=l[nums[i]]+1;j<=r[nums[i]];j++){
			k=max((p&j),k);
			if(ans==(p&j)){
				f=1;
				break;
			}
		}
		if(!f)ans=k;
	//	cout<<k<<"  ans: "<<ans<<endl;
	}               
	cout<<ans<<endl;             
	return;
}
signed main() {
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	//freopen("in.txt","r",stdin);
	//freopen("out.txt","w",stdout);
	int t=1;
	cin>>t;
	while(t--){
		solve();
	}
    return 0;
}