#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<to;x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

int N;
ll X[1010],Y[1010];
ll ret;
double m=1e200;

ll val(ll x) {
	double ma=0,mi=1e100;
	int i;
	if(x<1) return 1LL<<60;
	FOR(i,N) ma=max(ma,1.0*Y[i]*x+X[i]);
	FOR(i,N) mi=min(mi,1.0*Y[i]*x+X[i]);
	
	if(ma-mi<m || (ma-mi==m && x<ret)) m=ma-mi,ret=x;
	return ma-mi;
}


void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N;
	FOR(i,N) cin>>X[i]>>Y[i];
	
	val(1);
	set<ll> S;
	FOR(y,N) FOR(x,y) {
		if(Y[x]==Y[y]) continue;
		double aa = (X[y]-X[x])*1.0/(Y[x]-Y[y]);
		if(aa>=-1 && aa<=1e9) {
			S.insert(aa-1);
			S.insert(aa);
			S.insert(aa+1);
		}
	}
	ITR(it,S) val(*it);
	
	cout<<ret<<endl;
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false);
	FOR(i,argc-1) s+=argv[i+1],s+='\n';
	FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	solve(); return 0;
}