#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	random_device seed;
	mt19937 mt(seed());
	uniform_int_distribution dist(-10000, 10000);
	int n; cin >> n;
	vector<long long>x(2 * n), y(2 * n);
	rep(i, n)cin >> x[i] >> y[i];
	auto solve = [&](long long a, long long b)->pair<bool, long long> {
		if (a == 0 && b == 0)return { false,0 };
		vector<long long>c(2 * n);
		rep(i, 2 * n) {
			c[i] = a * x[i] + b * y[i];
		}
		sort(all(c));
		if (c[n] - c[n - 1] <= 1)return { false,0 };
		return{ true,-c[n] + 1 };
	};
	while (true) {
		long long a = dist(mt);
		long long b = dist(mt);
		auto[flg, c] = solve(a, b);
		if (flg) {
			cout << a << " " << b << " " << c << endl;
			return 0;
		}
	}
	return 0;
}