#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#define LL long long
using namespace std;
typedef pair<int,int>PII;
const int N = 2e5+10;
int a[N],b[N];
void solve()
{
int n;cin>>n;
for(int i=1;i<=n;i++)cin>>a[i]>>b[i];
int l=-1,r=1e18;
while(l+1<r)
{
int mid=l+r>>1;
int ok=true;
int x=0,y=0;
int tx,ty;
for(int i=1;i<=n;i++)
{
tx=max(x-mid,a[i]),ty=min(y+mid,b[i]);
if(tx<=ty)
{
x=tx,y=ty;
}
else
{
ok=false;
break;
}
}
if(!ok)l=mid;
else r=mid;
}
cout<<r<<endl;
}
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
int T;cin>>T;
while(T--)solve();
return 0;
}