#include <bits/stdc++.h>

using namespace std;

const int maxn = 2005;

class Mex{
public:
	int mex;
	int vis[maxn * 5];
	Mex(){ mex = 0, memset(vis, 0, sizeof(vis)); }
	inline int query(){ return mex; }
	inline void insert(int x){
		vis[x] = 1;
		for(; vis[mex]; ++mex);
		return;
	}
} f[maxn], g[maxn], h[maxn * 2];

const int dx[2] = {-1, -2};
const int dy[2] = {-2, -1};

const int n = 2000;
int a[maxn][maxn];

inline void precalc(){
	for(int i = 1; i <= n; ++i){ for(int j = 1; j <= n; ++j){
		a[i][j] = max(f[i].query(), max(g[j].query(), h[i - j + n].query()));
		for(int k = 0; k < 2; ++k){
			int x = i + dx[k], y = j + dy[k];
			if(x > 0 && y > 0 && a[x][y] == a[i][j]) ++a[i][j];
		}
		f[i].insert(a[i][j]), g[j].insert(a[i][j]), h[i - j + n].insert(a[i][j]);
		// if(i <= 5 && j <= 5) printf("%d ", a[i][j]);
	} /* if(i <= 5) puts(""); */ }
	return;
}

const int maxm = 15;

int m;
int X[maxm], Y[maxm];

inline void solve(){
	scanf("%d", &m);
	int xsum = 0;
	for(int i = 0; i < m; ++i) scanf("%d%d", X + i, Y + i), xsum ^= a[X[i]][Y[i]];
	// printf("xsum = %d\n", xsum);
	if(!xsum) puts("-1 -1 -1");
	else{
		pair<int, pair<int, int> > ans = make_pair(0x3f3f3f3f, make_pair(0x3f3f3f3f, 0x3f3f3f3f));
		for(int i = 0; i < m; ++i){
			int nxsum = xsum ^ a[X[i]][Y[i]];
			for(int j = 1; j <= X[i]; ++j) if(!(nxsum ^ a[j][Y[i]]))
				ans = min(ans, make_pair(i, make_pair(j, Y[i])));
			for(int j = 1; j <= Y[i]; ++j) if(!(nxsum ^ a[X[i]][j]))
				ans = min(ans, make_pair(i, make_pair(X[i], j)));
			for(int j = 1; j <= min(X[i], Y[i]) - 1; ++j) if(!(nxsum ^ a[X[i] - j][Y[i] - j]))
				ans = min(ans, make_pair(i, make_pair(X[i] - j, Y[i] - j)));
			for(int j = 0; j < 2; ++j)
				if(X[i] + dx[j] > 0 && Y[i] + dy[j] > 0 && !(nxsum ^ a[X[i] + dx[j]][Y[i] + dy[j]]))
					ans = min(ans, make_pair(i, make_pair(X[i] + dx[j], Y[i] + dy[j])));
		}
		printf("%d %d %d\n", ans.first + 1, ans.second.first, ans.second.second);
	}
}

int main(){
	precalc();
	int T;
	for(scanf("%d", &T); T--; solve());
	return 0;
}