#include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;
typedef long long ll;
int T,n,m,mx[N],mn[N];
pair<int,int>a[N];
ll ans;
struct seg{
	#define L k<<1
	#define R k<<1|1
	ll tr[N<<2],tg[N<<2];
	void pushtg(int k,ll v){
		tr[k]+=v,tg[k]+=v;
	}
	void pushdown(int k){
		if(tg[k]){
			pushtg(L,tg[k]);
			pushtg(R,tg[k]);
			tg[k]=0;
		}
	}
	void pushup(int k){
		tr[k]=min(tr[L],tr[R]);
	}
	void build(int k,int l,int r,int S){
		tg[k]=0;
		if(l==r){
			tr[k]=-a[l].first-(S&1)*a[l].first,void();
			if(S&2)tr[k]+=mx[l-1]-mn[l-1]-mn[l-1];
			else tr[k]+=mx[l-1]+mx[l-1]-mn[l-1];
			return;
		}
		int mid=l+r>>1;
		build(L,l,mid,S),build(R,mid+1,r,S);
		pushup(k);
	}
	void modify(int k,int l,int r,int x,int y,ll v){
		if(x<=l&&r<=y)return pushtg(k,v);
		pushdown(k);
		int mid=l+r>>1;
		if(x<=mid)modify(L,l,mid,x,y,v);
		if(y>mid)modify(R,mid+1,r,x,y,v);
		pushup(k);
	}
}sg[4];
void solve(){
	scanf("%d",&n);
	for(int i=1;i<=n;++i)scanf("%d%d",&a[i].first,&a[i].second);
	a[++n]=make_pair(0,0);
	sort(a+1,a+n+1);
	ans=1e18,m=1,mn[n+1]=mx[n+1]=0;
	while(a[m]!=make_pair(0,0))++m;
	for(int i=1;i<=m;++i)mx[i]=max(mx[i-1],a[i].second),mn[i]=min(mn[i-1],a[i].second);
	for(int i=n;i>=m;--i)mx[i]=max(mx[i+1],a[i].second),mn[i]=min(mn[i+1],a[i].second);
	for(int i=0;i<4;++i)sg[i].build(1,1,m,i);
	for(int i=n,j1=1,j2=1;i>=m;--i){
		for(int o=0;o<4;++o){
			ans=min(ans,sg[o].tr[1]+a[i].first+(o&1^1)*a[i].first);
			if(o&2){
				sg[o].modify(1,1,m,1,j1,-mx[i+1]);
				sg[o].modify(1,1,m,1,j2,mn[i+1]+mn[i+1]);
			}else{
				sg[o].modify(1,1,m,1,j1,-mx[i+1]-mx[i+1]);
				sg[o].modify(1,1,m,1,j2,mn[i+1]);
			}
		}
		while(j1<m&&mx[j1]<=mx[i]){
			++j1;
			for(int o=0;o<4;++o){
				if(o&2)sg[o].modify(1,1,m,j1,j1,-mx[j1-1]);
				else sg[o].modify(1,1,m,j1,j1,-mx[j1-1]-mx[j1-1]);
			}
		}
		while(j2<m&&mn[j2]>=mn[i]){
			++j2;
			for(int o=0;o<4;++o){
				if(o&2)sg[o].modify(1,1,m,j2,j2,mn[j2-1]+mn[j2-1]);
				else sg[o].modify(1,1,m,j2,j2,mn[j2-1]);
			}
		}
		for(int o=0;o<4;++o){
			if(o&2){
				sg[o].modify(1,1,m,1,j1,mx[i]);
				sg[o].modify(1,1,m,1,j2,-mn[i]-mn[i]);
			}else{
				sg[o].modify(1,1,m,1,j1,mx[i]+mx[i]);
				sg[o].modify(1,1,m,1,j2,-mn[i]);
			}
		}
	}
	printf("%lld\n",ans);
}
int main(){
	scanf("%d",&T);
	while(T--)solve();
	return 0;
}