#include<bits/stdc++.h>
using namespace std;
#define int long long
//#define x first
//#define y second
#define PII pair<int,int>
const int N=2e5+10;
const int mod=998244353;
vector<PII> g[N];
int vis[N];
int use[N];
vector<PII> ans;
void dfs(int x,int fa) {
	vis[x]=1;
	for(auto p:g[x]) {
		int y=p.first;
		if(!vis[y]) dfs(y,x);
	}
	int last=0;
	int f=0;
	for(auto p:g[x]) {
		if(use[p.second]) continue;
		int y=p.first;
		if(y==fa) f=p.second;
		else {
			if(!last) last=p.second;
			else {
				ans.push_back({last,p.second});
				use[last]=use[p.second]=1;
				last=0;
			}
		}
	}
	if(last&&f) {
		ans.push_back({last,f});
		use[last]=use[f]=1;
	}
}
void solve() {
	int n;
	cin>>n;
	int cnt=0;
	map<int,int> mp1,mp2;
	ans.clear();
	for(int i=1;i<=2*n;i++) g[i].clear(),use[i]=0;
	for(int i=1;i<=2*n;i++) {
		int x,y;
		cin>>x>>y;
		if(!mp1[x]) mp1[x]=++cnt;
		if(!mp2[y]) mp2[y]=++cnt;
		x=mp1[x],y=mp2[y];
		g[x].push_back({y,i});
		g[y].push_back({x,i});
		//cout<<x<<" "<<y<<endl;
	}
	for(int i=1;i<=2*n;i++) vis[i]=0;
	for(int i=1;i<=cnt;i++) {
		if(!vis[i]) {
			dfs(i,0);
		}
	}
	cout<<ans.size()<<endl;
	for(auto p:ans) cout<<p.first<<" "<<p.second<<endl;
	vector<int> v;
	int f=0;
		for (int i=1;i<=2*n;i++)
		if (use[i]==0){
			printf("%d",i);
			if (f) printf("\n");
			else printf(" ");
			f=1-f;
		}
}
signed main() {
	int T=1;
	cin>>T;
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	while(T--) {
		solve();
	}
}