#include <algorithm>
#include <vector>
#include <cfloat>
#include <string>
#include <cmath>
#include <set>
#include <cstdlib>
#include <map>
#include <ctime>
#include <iomanip>
#include <functional>
#include <deque>
#include <iostream>
#include <cstring>
#include <queue>
#include <cstdio>
#include <stack>
#include <climits>
#include <sys/time.h>
#include <cctype>

using namespace std;

typedef long long ll;

ll f(ll *a, ll *b, int n, ll x) {
  ll minv, maxv;
  minv = maxv = a[0]+b[0]*x;
  for (int i = 1; i < n; i++) {
    minv = min(a[i]+b[i]*x, minv);
    maxv = max(a[i]+b[i]*x, maxv);
  }

  return maxv-minv;
}

int main() {
  int n;
  cin >> n;
  ll a[n], b[n];
  for (int i = 0; i < n; i++) {
    cin >> a[i] >> b[i];
  }
  ll l, r;
  l = 1;
  r = 1000000000;
  for (int i = 0; i < 1000; i++) {
    ll c = (l+r)/2;
    if (f(a, b, n, c-1) > f(a, b, n, c)) {
      l = c;
    }else {
      r = c;
    }
  }
  if (f(a, b, n, l) > f(a, b, n, r)) {
    std::cout << r << std::endl;
  }else {
    std::cout << l << std::endl;
  }
}