#include<bits/stdc++.h>
#define maxn 2005
#define N 2000
#define n0 4000
std::bitset<n0> r[maxn],w[maxn],d[maxn*2];
int sg[maxn][maxn];
void presolve() {
    for(int i=0;i<=n0;i++) {
        r[0][i] = 1;
    }
    for(int i=0;i<=N;i++) {
        r[i] = r[0];
        w[i] = r[0];
    }
    for(int i=0;i<=2*N;i++) {
        d[i] = r[0];
    }
    d[2000][0] = 0;
    r[1][0] = 0;
    w[1][0] = 0;
    std::bitset<n0> now;
    int mx = 0;
    for(int i=1;i<=N;i++) {
        for(int j=1;j<=N;j++) {
            if (i==1&&j==1) {
                continue;
            }
            
            now = r[i] & w[j] & d[i-j+N];
            if(i > 1 && j > 2) {
                int p = sg[i-1][j-2];
                now[p] = 0;
            }
            if (i > 2 && j > 1) {
                int p = sg[i-2][j-1];
                now[p] = 0;
            }
            int val = now._Find_first();
            assert(val <= n0);
            mx = std::max(mx,val);
            r[i][val] = 0;
            w[j][val] = 0;
            d[i-j+2000][val] = 0;
            sg[i][j] = val;
        }
    }
    // std::cerr << mx << std::endl;
}
void solve() {
    int r[20],c[20];
    int k = 0,ans=0;
    std::cin >> k;
    for(int i=1;i<=k;i++) {
        std::cin >> r[i] >> c[i];
        ans ^= sg[r[i]][c[i]];
    }
    if (ans == 0) {
        printf("-1 -1 -1\n");
        return ;
    }
    for(int i=1;i<=k;i++) {

        for(int j=1;j<=r[i];j++) {
            if (!(ans ^ sg[r[i]][c[i]] ^ sg[j][c[i]])) {
                printf("%d %d %d\n",i,j,c[i]);
                return ;
            }
        }

        for(int j=1;j<=c[i];j++) {
            if (!(ans ^ sg[r[i]][c[i]] ^ sg[r[i]][j])) {
                printf("%d %d %d\n",i,j,c[i]);
                return ;
            }
        }

        for(int j=1;j<=std::min(r[i],c[i])-1;j++) {
            if (!(ans ^ sg[r[i]][c[i]] ^ sg[r[i]-j][c[i]-j])) {
                printf("%d %d %d\n",i,r[i]-j,c[i]-j);
                return ;
            }
        }

        int x = r[i] - 1, y = c[i] - 2;
        if (x >= 1 && y >= 1 && !(ans ^ sg[r[i]][c[i]] ^ sg[x][y])) {
            printf("%d %d %d\n",i,x,y);
            return ;
        }
        x = r[i] - 2, y = c[i] - 1;
        if (x >= 1 && y >= 1 && !(ans ^ sg[r[i]][c[i]] ^ sg[x][y])) {
            printf("%d %d %d\n",i,x,y);
            return ;
        }
    }
}
int main() {
	// freopen("in.txt","r",stdin);
	std::ios::sync_with_stdio(0);std::cin.tie(0);
    int T;
    presolve();
    std::cin >> T;
    while(T--) {
        solve();
    }
}