#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pair<int,int>>
#define vll vector<pair<ll,ll>>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define vvii vector<vector<pair<int,int>>>
#define vvll vector<vector<pair<ll,ll>>>
#define vst vector<string>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define mkunique(x) sort(all(x));(x).erase(unique(all(x)),(x).end())
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005,INF=15<<26;

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    ll N;cin>>N;
    vll S(N+N);
    for(int i=0;i<N+N;i++){
        cin>>S[i].fi>>S[i].se;
    }
    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
    
    while(1){
        ll a=rng()%(200001);
        if(a<0) a+=200001;
        a-=100000;
        
        ll b=rng()%(200001);
        if(b<0) b+=200001;
        b-=100000;
        
        ll l=-20000000001,r=20000000001;
        while(r-l>1){
            ll m=(l+r)/2;
            ll cn=0;
            for(int i=0;i<N+N;i++){
                auto [x,y]=S[i];
                if(a*x+b*y+m<0) cn++;
            }
            if(cn>=N) l=m;
            else r=m;
        }
        
        if(l>=-20000000000){
            ll cn=0;
            bool ok=true;
            for(int i=0;i<N+N;i++){
                auto [x,y]=S[i];
                if(a*x+b*y+l<0) cn++;
                if(a*x+b*y+l==0) ok=false;
            }
            
            if(ok&&cn==N){
                cout<<a<<" "<<b<<" "<<l<<"\n";
                return 0;
            }
        }
    }
}