#include<bits/stdc++.h>
#define pb emplace_back
#define fi first
#define se second
#define mp make_pair
using namespace std;
typedef long long ll;
const int maxn=1e3+10;//记得改回来 
void chkmax(int &x,int y){ x=x>y?x:y; }
void chkmin(int &x,int y){ x=x<y?x:y; }
struct node{
	int t,x;
	bool operator < (const node &rhs){ return t<rhs.t; }
}a[maxn];
int t[maxn],x[maxn],p[maxn],n; bool f[maxn][maxn];
bool check(int v){
	for(int i=0;i<=n;i++)
		for(int j=0;j<=n;j++) f[i][j]=0;
	f[0][0]=1;
	for(int i=0;i<n;i++){
		if(f[i][0]){
			f[i+1][i]=1;
			for(int j=0;j<=i;j++) f[i][j]=1;
		}
		for(int j=1;j<=i;j++){
			if(abs(x[i+1]-x[i])<=1ll*v*(t[i+1]-t[i])) 
				f[i+1][j]|=f[i][j];
			if(abs(x[i+1]-x[j])<=1ll*v*(t[i+1]-t[j]))
				f[i+1][i]|=f[i][j]; 
		}
	}
	bool flag=0;
	for(int i=0;i<=n;i++) flag|=f[n][i];
	return flag;
}
void solve(){
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	cin>>n;
	for(int i=1;i<=n;i++) cin>>a[i].t>>a[i].x;
	sort(a+1,a+1+n); 
	for(int i=1;i<=n;i++) t[i]=a[i].t,x[i]=a[i].x;
	int l=0,r=1e9;
	while(l<r){
		int mid=(l+r)>>1;
		if(check(mid)) r=mid;
		else l=mid+1;
	}
	cout<<l<<endl;
}
int main(){
	int T; cin>>T;
	while(T--) solve();
}