#include<cstdio>

#include<algorithm>

using namespace std;

int T,n;

struct node{

    int x,y;

}pt[];

bool cmp(node a,node b){

    if(a.x==b.x)

        return a.y<b.y;

    return a.x<b.x;

}

int main(){

    scanf("%d",&T);

    while(T--){

        scanf("%d",&n);

        for(int i=;i<=n;++i)

            scanf("%d%d",&pt[i].x,&pt[i].y);

        sort(pt+,pt+n+,cmp);

        int x1=pt[n/].x,y1=pt[n/].y;

        int x2=pt[n/+].x,y2=pt[n/+].y;

        int xx1,xx2,yy1,yy2;

        if((y1+y2)>=)

            yy1=1e9,yy2=y1-(yy1-y2);

        else

            yy2=-*1e9,yy1=y2+(y1-yy2);

        if((x1+x2)%==)

            xx1=(x1+x2)/-,xx2=xx1+;

        else

            xx1=x1+(x2-x1)/,xx2=xx1+;

        printf("%d %d %d %d\n",xx1,yy1,xx2,yy2);

    }

    return ;

}