#include<bits/stdc++.h>
using namespace std;

#include<atcoder/all>
using namespace atcoder;
using mint=atcoder::modint998244353;

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#define rep(i,n) for(int i=0;i<(n);i++)
#define rng(i,l,r) for(int i=(l);i<(r);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrng(i,l,r) for(int i=(r)-1;i>=(l);i--)

#define ALL(x) (x).begin(),(x).end()

#define int long long
#define fi first
#define se second

struct fast_io{fast_io(){cin.tie(nullptr)->sync_with_stdio(false);}}_;

void solve();
signed main(){
	int T=1;
	// cin>>T;
	while(T--)solve();
}

void solve(){
	int N;cin>>N;
	vector<pair<int,int>> v(2*N);
	for(auto&&[x,y]:v)cin>>x>>y;

	auto get=[&](double deg)->pair<int,int> {
		double a=tan(deg/180*acos(-1)),b=1;
		// cout<<"deg : "<<a<<" "<<b<<endl;
		int p=100000/max(abs(a),abs(b));
		int A=a*p,B=b*p;
		return {A,B};
	};
	
	for(int q=-1000;q<=1000;q+=100){

		rep(i,720){
			auto[A,B]=get(double(i)/4);
			// cout<<i<<" : "<<A<<" "<<B<<endl;
			int cnt1=0,cnt2=0;
			for(auto&&[x,y]:v){
				if(A*x-B*y-A*q<0)cnt1++;
				if(A*x-B*y-A*q==0)cnt2++;
			}

			if(cnt2)continue;
			// cout<<i<<" : "<<cnt1<<endl;
			if(cnt1==N){
				cout<<A<<" "<<-B<<" "<<-A*q<<endl;
				return;
			}
		}
	}

	assert(0);
}