#include <cstdio>
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <cmath>
#include <list>
#include <iomanip>
#include <fstream>

using namespace std;
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
template<class T> inline T sqr(T x) { return x*x; }
typedef pair<int, int> P;
typedef long long ll;
typedef unsigned long long ull;

#define rep(i,n)  for(int (i) = 0;(i) < (n);(i)++)
#define clr(a) memset((a), 0 ,sizeof(a))
#define mclr(a) memset((a), -1 ,sizeof(a))
#define all(a)  (a).begin(),(a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define sz(a) (sizeof(a))
#define Fill(a,v) fill((int*)a,(int*)(a+(sz(a)/sz(*(a)))),v)
bool cheak(int x, int y, int xMax, int yMax){ return x >= 0 && y >= 0 && xMax > x && yMax > y; }
const int dx[4] = { -1, 0, 1, 0 }, dy[4] = { 0, 1, 0, -1 };
const int mod = 1000000007;
const int INF = 2147483647;

ll n;
ll a[1010], b[1010];

ll solve(ll x){
	ll Max = 0,Min = 1e18;
	rep(i, n){
		ll v = a[i] + b[i]*x;
		Max = max(v,Max);
		Min = min(v,Min);
	}
	return Max - Min;
}

int main()
{
	//fstream fs("C:/Users/omu_/Desktop/425-testcase/test_in/12_randomC1.txt", ios::in);

	cin >> n;
	rep(i, n){
		cin >> a[i] >> b[i];
	}


	ll l=1,r=INF;
	ll m1,m2;

	while(1){

		m1 = (2*l+r)/3;
		m2 = (2*r+l)/3;

		ll m1v = solve(m1);
		ll m2v = solve(m2);

		if (m1v > m2v){
			l = m1;
		}else
		{
			r = m2;
		}


		if (abs(l-r) < 1000)
			break;

	}

	ll ans; ll Min = 1e18;
	for (ll i = l; i <= r; i++){
		ll t = solve(i);
		if (t < Min){
			Min = t;
			ans = i;
		}
		if (t == Min){
			ans = min(i,ans);
		}
	}

	cout << ans << endl;
	return 0;
}