#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

int main() {
	int N;
	scanf("%d", &N);
	vector<int> a(N), b(N);
	rep(i, N) scanf("%d%d", &a[i], &b[i]);
	vpii bis(N);
	rep(i, N) bis[i] = mp(b[i], i);
	sort(all(bis));
	vi candidates;
	candidates.push_back(1);
	rep(i, N) rep(j, N) {
//		int i = bis[ix].second, j = bis[ix+1].second;
		if(b[i] == b[j]) continue;
		//b_i x + a_i = b_j x + a_j
		//x = (a_j - a_i) / (b_i - b_j)
		int t = a[i] - a[j], u = b[j] - b[i];
		if(u < 0) t *= -1, u *= -1;
		if(t < 0) continue;
		if(t / u > 0) candidates.push_back(t / u);
		candidates.push_back(t / u + 1);
	}
	sort(all(candidates));
	candidates.erase(unique(all(candidates)), candidates.end());
	pair<ll,int> ans(INFL,-1);
	each(xi, candidates) {
		int x = *xi;
		ll ma = 0, mi = INFL;
		rep(i, N) {
			ll t = a[i] + (ll)b[i] * x;
			amax(ma, t);
			amin(mi, t);
		}
//		cerr << x << ": "<< ma << ", " << mi << endl;
		amin(ans, mp(ma - mi, x));
	}
	printf("%d\n", ans.second);
	return 0;
}