#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <chrono>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


#include <chrono>
#ifdef LOCAL
mt19937_64 rng(58);
#else
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
#endif


int N;
vector<Int> X, Y;

constexpr Int LIM = 100'000;

int main() {
  for (; ~scanf("%d", &N); ) {
    N *= 2;
    X.resize(N);
    Y.resize(N);
    for (int u = 0; u < N; ++u) {
      scanf("%lld%lld", &X[u], &Y[u]);
    }
    
    for (; ; ) {
      const Int a = -LIM + rng() % (LIM + 1 + LIM);
      const Int b = -LIM + rng() % (LIM + 1 + LIM);
      vector<Int> cs(N);
      for (int u = 0; u < N; ++u) cs[u] = -(a * X[u] + b * Y[u]);
      sort(cs.begin(), cs.end());
      if (cs[N/2 - 1] + 1 < cs[N/2]) {
        printf("%lld %lld %lld\n", a, b, cs[N/2 - 1] + 1);
        break;
      }
    }
  }
  return 0;
}