#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=4e5+5,M=N*40+5,K=1000+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(28382);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n;
using cp=complex<db>;
cp A[N];
void read(cp &x){
	uniform_real_distribution<> rd(0,eps);
	int a,b;scanf("%d%d",&a,&b);
	x=cp(a+rd(rnd),b+rd(rnd));
}
int flag=0;
int v1[N],v2[N];
db cross(cp x,cp y){
	return x.real()*y.imag()-x.imag()*y.real();
}
pair<db,int> i1[N],i2[N];
using line=pair<cp,cp>;
cp xPt(line x,line y){
	db S1=cross(x.fi-y.fi,y.se),S2=cross(y.se,x.fi+x.se-y.fi);
	// gdb(S1,S2);
	return x.fi+x.se*S1/(S1+S2);
}
int calc(db angle){
	if(flag) return 0;
	cp way1=cp(cos(angle),sin(angle));
	for(int i=1;i<=2*n;i++) i1[i]=make_pair(cross(A[i],way1),i);
	nth_element(i1+1,i1+n+1,i1+2*n+1);
	for(int i=1;i<=2*n;i++) v1[i1[i].se]=(i<=n);
	cp way2=way1*cp(0,1);
	for(int i=1;i<=2*n;i++) i2[i]=make_pair(cross(way2,A[i]),i);
	nth_element(i2+1,i2+n+1,i2+2*n+1);
	for(int i=1;i<=2*n;i++) v2[i2[i].se]=(i<=n);
	int cnt=0;
	for(int i=1;i<=n;i++) if(v1[i]&&v2[i]) cnt++;
	for(int i=n+1;i<=2*n;i++) if(!v1[i]&&!v2[i]) cnt--;
	if(!cnt){
		flag=1;
		int mx1=max_element(i1+1,i1+n+1)->se,mi1=min_element(i1+n+1,i1+2*n+1)->se;
		int mx2=max_element(i2+1,i2+n+1)->se,mi2=min_element(i2+n+1,i2+2*n+1)->se;
		cp pt=xPt(make_pair((A[mx1]+A[mi1])/2.0,way1),make_pair((A[mx2]+A[mi2])/2.0,way2));
		printf("%.9lf %.9lf\n",pt.real(),pt.imag());
		vector<int> st[2][2][2];
		for(int i=1;i<=2*n;i++) st[v1[i]][v2[i]][i<=n].push_back(i);
		static int ans[N];
		for(int x:{0,1}) for(int y:{0,1}){
			assert(st[x][y][1].size()==st[x^1][y^1][0].size());
			for(int i=0;i<st[x][y][1].size();i++) ans[st[x][y][1][i]]=st[x^1][y^1][0][i]-n;
		}
		for(int i=1;i<=n;i++) printf("%d%c",ans[i]," \n"[i==n]);
	}
	return cnt;
}
void Solve(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++) read(A[i]);
	for(int i=1;i<=n;i++) read(A[i+n]);
	flag=0;
	db l=0,r=acos(-1)/2,mid;
	int wl=calc(l),wr=calc(r);
	for(int i=1;!flag;i++){
		mid=(l+r)/2;
		int w=calc(mid);
		// gdb(wl,wr,w);
		if(1ll*w*wl<0) r=mid,wr=w;
		else l=mid,wl=w;
	}
	assert(flag);
}
int main(){
	int t=1;
	scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}