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

const int D = 10000;

random_device seed;
mt19937 mt(seed());
uniform_int_distribution dist(-D, D);

int main(){
	int n;
	cin >> n;
	vector<long long> x(2 * n), y(2 * n);
	for(int i = 0; i < 2 * n; i++) cin >> x[i] >> y[i];
	
	
	auto solve = [&](long long a, long long b) -> pair<bool, long long>{
		if(a == 0 and b == 0) return make_pair(false, 0LL);
		
		vector<long long> g(2 * n);
		for(int i = 0; i < 2 * n; i++) g[i] = a * x[i] + b * y[i];
		sort(g.begin(), g.end());
		
		if(g[n] - g[n - 1] <= 1) return make_pair(false, 0LL);
		else return make_pair(true, -g[n] + 1);
	};
	
	{
		long long a = dist(mt), b = dist(mt);
		auto [success, c] = solve(a, b);
		if(success){
			cout << a << ' ' << b << ' ' << c << "\n";
			return 0;
		}
	}
	
	return 0;
}