#include<bits/stdc++.h>
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("trapv")
#define st first
#define nd second
#define pb push_back
#define eb emplace_back
#define pp(x) pop_back(x)
#define mp(a, b) make_pair(a, b)
#define all(x) (x).begin(), (x).end()
#define rev(x) reverse(all(x))
#define sor(x) sort(all(x))
#define sz(x) (int)(x).size()
#define rsz(x) resize(x)
using namespace std;
///~~~~~~~~~~~~~~~~~~~~~~~~~~
template <typename H, typename T>
ostream& operator<<(ostream& os, pair<H, T> m){
return os <<"("<< m.st<<", "<<m.nd<<")";
}
template <typename H>
ostream& operator<<(ostream& os, vector<H> V){
os<<"{";
for(int i=0; i<V.size(); i++){
if(i)os<<" ";
os<<V[i];
}
os<<"}";
return os;
}
void debug(){cerr<<"\n";}
template <typename H, typename... T>
void debug(H h, T... t) {cerr<<h; if (sizeof...(t)) cerr << ", "; debug(t...);}
#define deb(x...) cerr<<#x<<" = ";debug(x);
///~~~~~~~~~~~~~~~~~~~~~~~~~
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii > vii;
typedef vector<ll> vl;
typedef vector<pll> vll;
typedef string str;
#define BOOST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
const int K=18, N=(1<<K), INF=1e9+5, mod=1e9+7, mod2=998244353;
struct modint{
int n=0;
modint(){}
modint(ll x){
n=x%mod;
if(n<0)n+=mod;
}
operator int(){
return n;
}
modint operator+(modint a){a.n = n+a.n; if(a.n>=mod)a.n-=mod;return a;}
modint operator+=(modint a){return (*this)=(*this)+a;}
modint operator-(modint a){a.n = n-a.n; if(a.n<0)a.n+=mod;return a;}
modint operator-=(modint a){return (*this)=(*this)-a;}
modint operator*(modint a){a.n = (n*1ll*a.n)%mod; return a;}
modint operator*=(modint a){return (*this)=(*this)*a;}
modint operator^(const ll &m)const{
modint a(1);
if(m==0)return a;
if(m==1)return (*this);
a=(*this)^(m/2);
a*=a;
return a*((*this)^(m&1));
}
modint odw(){
return (*this)^((ll)mod-2);
}
modint operator/(modint a){return (*this)*a.odw();}
modint operator/=(modint a){return (*this)=(*this)/a;}
bool operator==(modint a){return a.n==n;}
friend ostream& operator<<(ostream& os, modint m) {
return os << m.n;
}
};
modint fact[N], fact2[N];
typedef vector<modint> vm;
void factinit(){
fact[0]=1;
for(int i=1; i<N; i++){
fact[i]=(fact[i-1]*modint(i))%mod;
}
fact2[N-1]=fact[N-1].odw();
for(int i=N-2; i>=0; i--){
fact2[i]=(fact2[i+1]*modint(i+1))%mod;
}
}
modint npok(int _n, int _k){
return fact[_n]*fact2[_k]*fact2[_n-_k];
}
int n;
void refx(vii &V){for(pii &i:V)i.nd=-i.nd;}
void refy(vii &V){for(pii &i:V)i.st=-i.st;}
void refxy(vii &V){for(pii &i:V)swap(i.st, i.nd);}
bool cmp(vii &V, vii &V2){
int m1=0, m2=0;
for(int i=0; i<V.size(); i++)if(V[i]<V[m1])m1=i;
for(int i=0; i<V.size(); i++)if(V2[i]<V2[m2])m2=i;
int x=V[m1].st-V2[m2].st, y=V[m1].nd-V2[m2].nd;
for(int i=0;i<V.size(); i++){
if(V[m1].st-x!=V2[m2].st || V[m1].nd-y!=V2[m2].nd){
return 0;
}
if(++m1>=V.size())m1=0;
if(++m2>=V.size())m2=0;
}
return 1;
}
bool row(vii &V, vii &V2){
//deb(V, V2);
if(cmp(V, V2))return 1;refx(V);
if(cmp(V, V2))return 1;refy(V);
if(cmp(V, V2))return 1;refx(V);
if(cmp(V, V2))return 1;refxy(V);
//deb(V, V2);
if(cmp(V, V2))return 1;refy(V);
if(cmp(V, V2))return 1;refx(V);
if(cmp(V, V2))return 1;refy(V);
if(cmp(V, V2))return 1;refxy(V);
rev(V);
if(cmp(V, V2))return 1;refx(V);
if(cmp(V, V2))return 1;refy(V);
if(cmp(V, V2))return 1;refx(V);
if(cmp(V, V2))return 1;refxy(V);
//deb(V, V2);
if(cmp(V, V2))return 1;refy(V);
if(cmp(V, V2))return 1;refx(V);
if(cmp(V, V2))return 1;refy(V);
if(cmp(V, V2))return 1;refxy(V);
//deb(V, V2);
return 0;
}
vector<vector<int>> pocz, kon;
vi war;
bool dob(int l, int r, int h){
bool ans=1;
for(l+=n, r+=n; l<r; l>>=1, r>>=1){
if(l&1){
ans&=((lower_bound(all(pocz[l]), h)-pocz[l].begin())==(upper_bound(all(kon[l]), h)-kon[l].begin()));
l++;
}
if(r&1){
--r;
ans&=((lower_bound(all(pocz[r]), h)-pocz[r].begin())==(upper_bound(all(kon[r]), h)-kon[r].begin()));
}
if(!ans)break;
}
return ans;
}
int dost=200000;
pair<bool, pair<pii, pii>> solve(vii &V){
deb("c");
pair<bool, pair<pii, pii>> nie={0, {{0, 0}, {0, 0}}};
if(V[0].nd!=V[1].nd){
for(int i=0; i<n-1; i++)swap(V[i], V[i+1]);
}
pocz.clear();
kon.clear();
pocz.resize(2*n);
kon.resize(2*n);
map<int, int> M;
for(int i=0; i<n; i++)M[V[i].st]=1;
int wsk=0;
for(auto &i:M){
i.nd=wsk++;
}
for(int i=1; i<n; i+=2){
pii a=V[i], b=V[(i+1)%n];
assert(a.st==b.st);
int j=M[a.st]+n;
pocz[j].pb(min(a.nd, b.nd));
kon[j].pb(max(a.nd, b.nd));
}
for(int i=n; i<n+n; i++){
if(!pocz[i].size())continue;
sor(pocz[i]);
sor(kon[i]);
}
for(int i=n-1; i>0; i--){
int wsk1=0, wsk2=0;
while(wsk1!=pocz[i+i].size() || wsk2!=pocz[i+i+1].size()){
if(wsk1!=pocz[i+i].size() && (wsk2==pocz[i+i+1].size() || pocz[i+i][wsk1]<pocz[i+i+1][wsk2])){
pocz[i].pb(pocz[i+i][wsk1++]);
}
else pocz[i].pb(pocz[i+i+1][wsk2++]);
}
wsk1=0, wsk2=0;
while(wsk1!=kon[i+i].size() || wsk2!=kon[i+i+1].size()){
if(wsk1!=kon[i+i].size() && (wsk2==kon[i+i+1].size() || kon[i+i][wsk1]<kon[i+i+1][wsk2])){
kon[i].pb(kon[i+i][wsk1++]);
}
else kon[i].pb(kon[i+i+1][wsk2++]);
}
//deb(pocz[i], kon[i]);
}
ll A=0, A2=0;
for(int i=0; i<n; i+=2){
A+=(V[i+1].st-V[i].st)*1ll*V[i].nd;
//deb((V[i+1].st-V[i].st)*1ll*V[i].nd);
if(i<=n/2)A2+=(V[i+1].st-V[i].st)*1ll*V[i].nd;
}
if(A&1)return nie;
A/=2;
if(n&2){
for(int i=1; i<n; i+=2){
A2-=(V[i].st-V[i-1].st)*1ll*V[i].nd;
int j=(i+n/2)%n;
if((V[j].st-V[i].st)*1ll*(V[i].st-V[i-1].st)>0 && (A-A2)%(V[i].st-V[j].st)==0){
int h=(A-A2)/(V[i].st-V[j].st);
if(h==V[i].nd && dob(M[min(V[i].st, V[j].st)]+1, M[max(V[i].st, V[j].st)], h)){
//deb(i);
vector<pii> V2, V3;
for(int k=i; k!=j; k=(k+1)%n){
V2.pb(V[k]);
}
V2.eb(V[j].st, h);
V3.eb(V[j].st, h);
for(int k=j; k!=i; k=(k+1)%n){
V3.pb(V[k]);
}
//deb(V2, V3);
assert(dost--);
if(row(V2, V3)){
bool b=1;
for(int k=0; k<n; k+=2){
if(V[k].nd==h && min(max(V[k].st, V[k+1].st), max(V[i].st, V[j].st))>
max(min(V[k].st, V[k+1].st), min(V[i].st, V[j].st)))b=0;
//if(min(V[i].st, V[j].st)<V[k+1].st && max(V[i].st, V[j].st) >V[k+1].st &&min(V[k+1].nd, V[(k+2)%n].nd)<h && max(V[k+1].nd, V[(k+2)%n].nd)>h)b=0;
}
if(b)return {1, {V[i], {V[j].st, h}}};
}
}
}
A2+=(V[j+1].st-V[j].st)*1ll*V[j].nd;
}
}
else{
deb(A, A2);
for(int i=1; i<n; i+=2){
A2-=(V[i].st-V[i-1].st)*1ll*V[i].nd;
int j=(i+n/2)%n;
//deb(i, j, A2);
if(V[i].st!=V[j].st && (A-A2)%(V[i].st-V[j].st)==0){
//deb(i, j);
int h=(A-A2)/(V[i].st-V[j].st);
//deb(h);
if(h>=min(V[i].nd, V[(i+1)%n].nd) && h<=max(V[i].nd, V[(i+1)%n].nd) && h>=min(V[j].nd, V[(j+1)%n].nd)
&& h<=max(V[j].nd, V[(j+1)%n].nd) && dob(M[min(V[i].st, V[j].st)]+1, M[max(V[i].st, V[j].st)], h)){
deb(i);
vector<pii> V2, V3;
V2.pb({V[i].st, h});
if(V[(i+1)%n].nd!=h)V2.pb(V[(i+1)%n]);
for(int k=(i+1)%n; k!=j%n; k=(k+1)%n){
if(k!=(i+1)%n)V2.pb(V[k]);
}
if(V[j].nd!=h){
V2.pb(V[j]);
V2.eb(V[j].st, h);
}
V3.pb({V[j].st, h});
if(V[(j+1)%n].nd!=h)V3.pb(V[(j+1)%n]);
for(int k=(j+1)%n; k!=i%n; k=(k+1)%n){
if(k!=(j+1)%n)V3.pb(V[k]);
}
if(V[i].nd!=h){
V3.pb(V[i]);
V3.eb(V[i].st, h);
}
/*if(1){
cerr<<V2.size()<<" q:\n";
deb(V2[0], V2[1], V2[V2.size()-2], V2[V2.size()-1]);
cerr<<V3.size()<<" q:\n";
deb(V3[0], V3[1], V3[V3.size()-2], V3[V3.size()-1]);
}*/
assert(dost--);
if(row(V2, V3)){
//deb(i, V[i], V[j]);
bool b=1;
for(int k=0; k<n; k+=2){
if(V[k].nd==h && min(max(V[k].st, V[k+1].st), max(V[i].st, V[j].st))>
max(min(V[k].st, V[k+1].st), min(V[i].st, V[j].st))){
b=0;
}
if(min(V[i].st, V[j].st)<V[k+1].st && max(V[i].st, V[j].st)>V[k+1].st &&
min(V[k+1].nd, V[(k+2)%n].nd)<h && max(V[k+1].nd, V[(k+2)%n].nd)>h){
assert(false);
b=0;}
}
if(b)return {1, {{V[i].st, h}, {V[j].st, h}}};
}
}
}
A2+=(V[(j+2)%n].st-V[(j+1)%n].st)*1ll*V[(j+1)%n].nd;
}
A2=0;
for(int i=0; i<n; i+=2){
//A+=(V[i+1].st-V[i].st)*1ll*V[i].nd;
//deb((V[i+1].st-V[i].st)*1ll*V[i].nd);
if(i<=n/2+2)A2+=(V[i+1].st-V[i].st)*1ll*V[i].nd;
}
for(int i=1; i<n; i+=2){
A2-=(V[i].st-V[i-1].st)*1ll*V[i].nd;
int j=(i+n/2+2)%n;
//deb(i, j, A2);
if(V[i].st!=V[j].st && (A-A2)%(V[i].st-V[j].st)==0){
//deb(i, j);
int h=(A-A2)/(V[i].st-V[j].st);
//deb(h);
if(h==V[(i+1)%n].nd && h==V[j].nd && ((V[j].st-V[j-1].st)*1ll*(V[(i+1)%n].st-V[(i+2)%n].st)<0)
&& ((V[j].st-V[j-1].st)*1ll*(V[j].st-V[i].st)<0)
&& dob(M[min(V[i].st, V[j].st)]+1, M[V[j].st], h)){
//deb("\n\nwww\n\n", i);
//return nie;
vector<pii> V2, V3;
for(int k=(i+2)%n; k!=j; k=(k+1)%n){
V2.pb(V[k]);
}
for(int k=j; k!=(i+2)%n; k=(k+1)%n){
V3.pb(V[k]);
}
/*if(1){
cerr<<V2.size()<<" q:\n";
//deb(V2[0], V2[1], V2[V2.size()-2], V2[V2.size()-1]);
for(pii i:V2)cerr<<i.st<<" "<<i.nd<<"\n";
cerr<<V3.size()<<" q:\n";
for(pii i:V3)cerr<<i.st<<" "<<i.nd<<"\n";
//deb(V3[0], V3[1], V3[V3.size()-2], V3[V3.size()-1]);
}*/
assert(dost--);
if(row(V2, V3)){
//deb(i, V[i], V[j]);
bool b=1;
for(int k=0; k<n; k+=2){
if(V[k].nd==h && min(max(V[k].st, V[k+1].st), max(V[i].st, V[j].st))>
max(min(V[k].st, V[k+1].st), min(V[i].st, V[j].st))){
b=0;
}
//if(min(V[i].st, V[j].st)<V[k+1].st && max(V[i].st, V[j].st)>V[k+1].st &&min(V[k+1].nd, V[(k+2)%n].nd)<h && max(V[k+1].nd, V[(k+2)%n].nd)>h){b=0;}
}
if(b)return {1, {{V[i].st, h}, {V[j].st, h}}};
}
}
}
A2+=(V[(j+2)%n].st-V[(j+1)%n].st)*1ll*V[(j+1)%n].nd;
}
}
return nie;
}
int main(){
//factinit();
//BOOST;
cin>>n;
vii V(n);
for(auto &i:V)cin>>i.st>>i.nd;//, i.st*=2, i.nd*=2;
war.resize(n+n);
for(int i=n; i<n+n; i++)war[i]=0;
for(int i=n-1; i>=0; i--){
war[i]=war[i+i]+1;
}
auto t=solve(V);
//return 0;
//deb("a", t.st);
if(t.st==0){
refxy(V);
t=solve(V);
swap(t.nd.st.st, t.nd.st.nd);
swap(t.nd.nd.st, t.nd.nd.nd);
}
//return 0;
//deb("a", t.st);
if(t.st==0){
refxy(V);
rev(V);
t=solve(V);
}
//deb("a", t.st);
if(t.st==0){
refxy(V);
t=solve(V);
swap(t.nd.st.st, t.nd.st.nd);
swap(t.nd.nd.st, t.nd.nd.nd);
}
if(t.st==0)cout<<"NO\n";
else{
//cout<<ld(t.nd.st.st)/2<<" "<<ld(t.nd.st.nd)/2<<" "<<ld(t.nd.nd.st)/2<<" "<<ld(t.nd.nd.nd)/2;
cout<<t.nd.st.st<<" "<<t.nd.st.nd<<" "<<t.nd.nd.st<<" "<<t.nd.nd.nd;
}
}
