#include<bits/stdc++.h>

using namespace std;

int t,n;

typedef long long ll;

#define P pair<ll,ll>

#define fi first

#define se second

P A[];

ll mx,my;

bool cmp(P a,P b)

{

    return a.se*b.fi>a.fi*b.se;

}

int main()

{

    scanf("%d",&t);

    while(t--)

    {

        srand(time(NULL));

        scanf("%d",&n);

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

        {

            scanf("%lld%lld",&A[i].fi,&A[i].se);

            if(i==)mx=A[i].fi,my=A[i].se;

            mx=min(A[i].fi,mx);

            my=min(A[i].se,my);

        }

        mx-=rand()%+;

        my-=rand()%+;

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

            A[i].fi-=mx;

            A[i].se-=my;

        }

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

        P a=A[n/],b=A[n/+];

        cout<<mx<<' '<<my<<' ';

        ll x=a.fi+b.fi;

        ll y=a.se+b.se;

        cout<<x+mx<<' '<<y+my<<'\n';

    }

}