#include<bits/stdc++.h>
using namespace std;
int T,n,lsh1[400005],lsh2[400005],tt1,tt2;
struct seg{
	int xl,xr,yl,yr;
}arr[200005];
int tt;
struct edge{
	int l,r,o;
	edge(int l_,int r_,int o_){
		l=l_,r=r_,o=o_;
	}
	edge(){}
}line[400005];
vector<edge>vec[400005];
bool operator<(edge x,edge y){
	if(x.l==y.l)return x.r>y.r;
	return x.l<y.l;
}
struct node{
	int cov,pos,cnt,ans[3],vl,vr,len;
	void init(int u){
		cov=0,pos=0,cnt=ans[0]=ans[1]=ans[2]=len=u,vl=vr=0;
	}
};
/*
cov=0的左端点是否相等，连续段长度，个数 
*/
struct SGT{
	int l,r,lazy1,lazy2;
	node val;
}Tree[1600005];
node merge(node vl,node vr){
	node res;
	res.cov=min(vl.cov,vr.cov);
	res.cnt=0;
	res.len=vl.len+vr.len;
	res.vl=vl.vl;
	res.vr=vr.vr;
	bool fl1=0,fl2=0;
	if(res.cov==vl.cov){
		res.cnt+=vl.cnt;
		fl1=1;
	}
	if(res.cov==vr.cov){
		res.cnt+=vr.cnt;
		fl2=1;
	}
	if(fl1&&fl2){
		res.pos=(vl.pos==vr.pos?vl.pos:-1);
		res.ans[0]=max(vl.ans[0],vr.ans[0]);
		res.ans[1]=vl.ans[1];
		res.ans[2]=vr.ans[2];
		if(vl.vr==res.cov&&vr.vl==res.cov)res.ans[0]=max(res.ans[0],vr.ans[1]+vl.ans[2]);
		if(vl.ans[0]==vl.len)res.ans[1]=vl.len+vr.ans[1];
		if(vr.ans[0]==vr.len)res.ans[2]=vr.len+vl.ans[2];
	}
	else if(fl1){
		res.pos=vl.pos;
		res.ans[0]=vl.ans[0];
		res.ans[1]=vl.ans[1];
		res.ans[2]=0;
	}
	else{
		res.pos=vr.pos;
		res.ans[0]=vr.ans[0];
		res.ans[1]=0;
		res.ans[2]=vr.ans[2];
	}
	return res;
} 
void ztree(int p,int l,int r){
	Tree[p].l=l,Tree[p].r=r;
	Tree[p].lazy1=0,Tree[p].lazy2=-1;
	if(l==r){
		Tree[p].val.init(lsh2[l]-lsh2[l-1]);
		return;
	}
	int mid=l+r>>1;
	ztree(p*2,l,mid);
	ztree(p*2+1,mid+1,r);
	Tree[p].val=merge(Tree[p*2].val,Tree[p*2+1].val);
}
void pushdown(int p){
	if(Tree[p].lazy1!=0){
		Tree[p*2].lazy1+=Tree[p].lazy1;
		Tree[p*2].val.vl+=Tree[p].lazy1;
		Tree[p*2].val.vr+=Tree[p].lazy1;
		Tree[p*2].val.cov+=Tree[p].lazy1;
		Tree[p*2+1].lazy1+=Tree[p].lazy1;
		Tree[p*2+1].val.vl+=Tree[p].lazy1;
		Tree[p*2+1].val.vr+=Tree[p].lazy1;
		Tree[p*2+1].val.cov+=Tree[p].lazy1;
		Tree[p].lazy1=0; 
	}
	if(Tree[p].lazy2!=-1){
		if(Tree[p*2].val.cov==Tree[p].val.cov){
			Tree[p*2].val.pos=Tree[p].lazy2;
			Tree[p*2].lazy2=Tree[p].lazy2;
		}
		if(Tree[p*2+1].val.cov==Tree[p].val.cov){
			Tree[p*2+1].val.pos=Tree[p].lazy2;
			Tree[p*2+1].lazy2=Tree[p].lazy2;
		}
		Tree[p].lazy2=-1;
	}
}
void add(int p,int l,int r,int v){
	if(l<=Tree[p].l&&Tree[p].r<=r){
		Tree[p].lazy1++;
		Tree[p].val.cov++;
		Tree[p].val.vl++;
		Tree[p].val.vr++;
		if(Tree[p].val.cov==1){
			Tree[p].lazy2=v;
			Tree[p].val.pos=v;
		}
		return;
	}
	pushdown(p);
	int mid=Tree[p].l+Tree[p].r>>1;
	if(l<=mid)add(p*2,l,r,v);
	if(r>mid)add(p*2+1,l,r,v);
	Tree[p].val=merge(Tree[p*2].val,Tree[p*2+1].val);
}
node tmp[1000005];
int tot,st[1000005];
node tmp1[1000005];
int tot1,st1[1000005];
void Ins(int p){
	if(Tree[p].val.cov>0){
		st[++tot]=-1;
		return;
	}
	if(Tree[p].val.pos!=-1){
		int L=Tree[p].val.pos;
		tmp[++tot]=Tree[p].val;
		st[tot]=L;
//		cout<<L<<" 11112122121\n"<<tot<<endl;
		return;
	}
	pushdown(p);
	Ins(p*2);
	Ins(p*2+1);
}
void dec(int p,int l,int r){
	if(l<=Tree[p].l&&Tree[p].r<=r){
		Tree[p].lazy1--;
		Tree[p].val.cov--;
		Tree[p].val.vl--;
		Tree[p].val.vr--;
		return;
	}
	pushdown(p);
	int mid=Tree[p].l+Tree[p].r>>1;
	if(l<=mid)dec(p*2,l,r);
	if(r>mid)dec(p*2+1,l,r);
	Tree[p].val=merge(Tree[p*2].val,Tree[p*2+1].val);
}
void change(int p,int l,int r){
	if(l<=Tree[p].l&&Tree[p].r<=r){
		Ins(p);
		if(Tree[p].val.cov==0){
//			cout<<p<<" "<<Tree[p].l<<" "<<Tree[p].r<<" "<<Tree[p].val.pos<<endl;
			Tree[p].lazy2=0;
			Tree[p].val.pos=0;
		}
		return;
	}
	pushdown(p);
	int mid=Tree[p].l+Tree[p].r>>1;
	if(l<=mid)change(p*2,l,r);
	if(r>mid)change(p*2+1,l,r);
	Tree[p].val=merge(Tree[p*2].val,Tree[p*2+1].val);
}
set<edge>s;
#define pii pair<int,int>
#define mp make_pair
map<pii,int>len,mx;
void solve(int l,int r,int id){
//	cout<<lsh2[l-1]+1<<" "<<lsh2[r]<<" "<<id<<endl;
	tot=tot1=0;
	change(1,l,r);
	for(int j=1;j<=tot;j++){
//		cout<<lsh1[st[j]-1]+1<<" "<<lsh1[id]<<" "<<tmp[j].ans[0]<<" "<<tmp[j].ans[1]<<" "<<tmp[j].ans[2]<<" "<<tmp[j].cov<<" "<<tmp[j].vl<<" "<<tmp[j].vr<<endl;
		if(st1[tot1]==st[j]&&st[j]!=-1){
			tmp1[tot1]=merge(tmp1[tot1],tmp[j]);
		}
		else{
			tot1++;
			st1[tot1]=st[j];
			tmp1[tot1]=tmp[j];
		}
	}
	for(int j=1;j<=tot1;j++){
		if(st1[j]==-1)continue;
//		cout<<lsh1[st1[j]-1]+1<<" "<<lsh1[id]<<" "<<tmp1[j].ans[0]<<" "<<tmp1[j].ans[1]<<" "<<tmp1[j].ans[2]<<" "<<tmp1[j].cov<<" "<<tmp1[j].vl<<" "<<tmp1[j].vr<<endl;
		s.insert(edge(st1[j],id,0));
		len[mp(st1[j],id)]+=tmp1[j].cnt;
		mx[mp(st1[j],id)]=max(mx[mp(st1[j],id)],tmp1[j].ans[0]);
	}
}
int main(){
	scanf("%d",&T);
	while(T--){
		scanf("%d",&n);
		tt1=tt2=0;
		for(int i=1;i<=n;i++){
			scanf("%d%d%d%d",&arr[i].xl,&arr[i].yl,&arr[i].xr,&arr[i].yr);
			lsh1[++tt1]=arr[i].xl-1;
			lsh1[++tt1]=arr[i].xr;
			lsh2[++tt2]=arr[i].yl-1;
			lsh2[++tt2]=arr[i].yr;
		}
		sort(lsh1+1,lsh1+1+tt1);
		sort(lsh2+1,lsh2+1+tt2);
		tt1=unique(lsh1+1,lsh1+1+tt1)-lsh1-1;
		tt2=unique(lsh2+1,lsh2+1+tt2)-lsh2-1;
		for(int i=1;i<=tt1+1;i++)vec[i].clear();
		for(int i=1;i<=n;i++){
			arr[i].xl=lower_bound(lsh1+1,lsh1+1+tt1,arr[i].xl-1)-lsh1+1;
			arr[i].xr=lower_bound(lsh1+1,lsh1+1+tt1,arr[i].xr)-lsh1;
			arr[i].yl=lower_bound(lsh2+1,lsh2+1+tt2,arr[i].yl-1)-lsh2+1;
			arr[i].yr=lower_bound(lsh2+1,lsh2+1+tt2,arr[i].yr)-lsh2;
			vec[arr[i].xl].push_back(edge(arr[i].yl,arr[i].yr,1));
		}
		for(int i=1;i<=n;i++){
			vec[arr[i].xr+1].push_back(edge(arr[i].yl,arr[i].yr,-1));
		}
		ztree(1,1,tt2);
		s.clear(),len.clear(),mx.clear();
		for(int i=1;i<=tt1+1;i++){
			tt=0;
			for(auto to:vec[i]){
				if(to.o==1)add(1,to.l,to.r,i);
				else{
					dec(1,to.l,to.r);
					line[++tt].l=to.l,line[tt].r=to.r;
				}
			}
			sort(line+1,line+1+tt);
			int l=line[1].l,rmx=line[1].r;
			line[tt+1].l=1e9;
			for(int j=2;j<=tt+1;j++){
				if(rmx+1<line[j].l)solve(l,rmx,i-1),l=line[j].l;
				rmx=max(rmx,line[j].r);
			}
			//i-1;
		}
		printf("%d\n",(int)s.size());
		for(auto to:s)printf("%d %d %d %d\n",lsh1[to.l-1]+1,lsh1[to.r],len[mp(to.l,to.r)],mx[mp(to.l,to.r)]);
		puts("");
	}
	return 0;
}