```cpp
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<set>
#include<queue>
#include<cmath>
using namespace std;
typedef long long ll;
ll n;
const double INF = 1e48;
struct node{
double x,y;
bool flag;
};
node a[200005];
node b[200005];
double dis(node a,node b){
if(a.flag==b.flag){
return INF;
}else{
return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}
}
bool cmpy(node a,node b){
return a.y<b.y;
}
bool cmp(node a,node b){
return a.x<b.x;
}
double DIS(ll l,ll r){
if(l==r)return INF;
if(r-l==1){
return dis(a[l],a[r]);
}
ll mid = (l + r) / 2;
double mi = INF;
double lmi = DIS(l,mid);
double rmi = DIS(mid+1,r);
mi = min(lmi,rmi);
ll cnt = 0;
for(int i = l; i <= r; i++){
if(abs(a[i].x-a[mid].x)<=mi){
b[cnt++] = a[i];
}
}
sort(b,b+cnt,cmpy);
for(int i = 0; i < cnt; i++){
for(int j = i+1; j < cnt; j++){
if(abs(b[i].y-b[j].y)>mi)break;
mi = min(mi,dis(b[i],b[j]));
}
}
return mi;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin>>t;
while(t--){
cin>>n;
for(int i = 1; i <= n; i++){
cin>>a[i].x>>a[i].y;
a[i].flag = false;
}
for(int i = 1; i <= n; i++){
cin>>a[i+n].x>>a[i+n].y;
a[i].flag = true;
}
sort(a+1,a+2*n+1,cmp);
printf("%.3f\n",DIS(1,2*n));
}
return 0;
}