#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define endl '\n' #define ALL(v) (v).begin(), (v).end() #define RALL(v) (v).rbegin(), (v).rend() #define UNIQ(v) (v).erase(unique((v).begin(), (v).end()), (v).end()) typedef long long ll; typedef long double ld; typedef pair P; typedef complex comp; typedef vector< vector > matrix; struct pairhash { public: template size_t operator()(const pair &x) const { size_t seed = hash()(x.first); return hash()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2); } }; const int inf = 1e9 + 9; const ll mod = 1e9 + 7; const double eps = 1e-8; const double pi = acos(-1); int N, n; ll A[1010], B[1010]; ll a[1000100], b[1000100]; ll check(ll k) { ll lb = 1, ub = 1e10; for (int i = 0; i < n; i++) { if (b[i] == 0) { if (a[i] > k) return -1; } else if (b[i] > 0) { ub = min(ub, (k - a[i]) / b[i]); } else { lb = max(lb, (a[i] - k - b[i] - 1) / -b[i]); } } return (ub >= lb ? lb : -1); } ll solve() { n = N * N; int idx = 0; for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { a[idx] = A[i] - A[j]; b[idx] = B[i] - B[j]; idx++; } } ll lb = -1, ub = 1e12; ll res; while (ub - lb > 1) { ll mid = (ub + lb) / 2; ll c = check(mid); if (c >= 0) { res = c; ub = mid; } else { lb = mid; } } return res; } void input() { cin >> N; for (int i = 0; i < N; i++) cin >> A[i] >> B[i]; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(15); input(); cout << solve() << endl; }