#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <unordered_map>
#include <vector>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int v, w; };

ll MOD = 1000000009;
ll _MOD = 1000000009;
double EPS = 1e-10;

ll f(vector<int>& a, vector<int>& b, ll x) {
	int N = a.size();
	ll mini = LLONG_MAX, maxi = 0;
	for (int i = 0; i < N; i++) {
		ll y = a[i] + b[i] * x;
		mini = min(mini, y);
		maxi = max(maxi, y);
	}
	return maxi - mini;
}

int main() {
	int N; cin >> N;
	vector<int> a(N), b(N);
	for (int i = 0; i < N; i++)
		cin >> a[i] >> b[i];
	int lb = 0, ub = 1000000000;
	while (ub - lb > 1) {
		int mid = (lb + ub) / 2;
		ll df = f(a, b, mid + 1) - f(a, b, mid);
		if (df >= 0) ub = mid;
		else lb = mid;
	}
	cout << ub << endl;
}