/* -*- coding: utf-8 -*-
 *
 * 180.cc: No.180 美しいWhitespace (2) - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 1000;

typedef long long ll;
const ll LINF = 1LL << 60;

/* typedef */

/* global variables */

int n;
ll as[MAX_N], bs[MAX_N];

/* subroutines */

ll f(ll x) {
  ll maxab = -1, minab = LINF;
  for (int i = 0; i < n; i++) {
    ll ab = as[i] + bs[i] * x;
    if (maxab < ab) maxab = ab;
    if (minab > ab) minab = ab;
  }
  return maxab - minab;
}

/* main */

int main() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> as[i] >> bs[i];

  ll xl = 1, xr = 1000000000 + 1;
  while (xl + 2 < xr) {
    ll x0 = (xl * 2 + xr) / 3, x1 = (xl + xr * 2) / 3;
    if (f(x0) <= f(x1)) xr = x1;
    else xl = x0;
  }
  //printf("%lld-%lld\n", xl, xr);

  ll minf = LINF, minx = -1;
  for (ll x = xl; x <= xr; x++) {
    ll fx = f(x);
    if (minf > fx) {
      minf = fx;
      minx = x;
    }
  }

  printf("%lld\n", minx);
  return 0;
}