#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll,ll> P;
#define REP(i,n) for(ll i=0;i<ll(n);i++)









int main(void){
	cin.tie(nullptr);  ios_base::sync_with_stdio(false);
	ll i,j;


	ll N;
	cin >> N;


	map<ll,vector<ll>> mx,my;
	vector<ll> x(2*N+1),y(2*N+1);
	for(i=1;i<=2*N;i++){
		ll X,Y;
		cin >> X >> Y;

		x[i]=X;
		y[i]=Y;
		mx[X].push_back(Y);
		my[Y].push_back(X);
	}


	ll s=0,p=-1,q=-1;
	for(auto e:mx){
		s+=(ll)mx[e.first].size();
		if(s==N){
			p=e.first;
			break;
		}
		else if(s>N) q=e.first;
	}

	if(p!=-1){
		cout << 2 << ' ' << 0 << ' ' << -2*p-1 << endl;
		return 0;
	}


	ll pp=-1,qq=-1;
	s=0;
	for(auto e:my){
		s+=(ll)my[e.first].size();
		if(s==N){
			pp=e.first;
			break;
		}
		else if(s>N) qq=e.first;
	}

	if(pp!=-1){
		cout << 0 << ' ' << 2 << ' ' << -2*pp-1 << endl;
		return 0;
	}


    ll ng=-10000000000-1,ok=10000000000+1;
    while(ok-ng>1){

         ll m=(ok+ng)/2;

         ll t=0;
         for(i=1;i<=2*N;i++){
        	 if(x[i]!=q) continue;
        	 if(y[i]>500000*q+m) t++;
         }

          if(t>=N) ok=m;
          else ng=m;

      }



     cout << 500000 << ' ' << -1 << ' ' << ok << endl;












	return 0;
}