#include <bits/stdc++.h> #define EPS 1e-9 #define INF 1070000000LL #define MOD 1000000007LL #define fir first #define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++) #define numa(x,a) for(auto x: a) #define ite iterator #define mp make_pair #define rep(i,n) rep2(i,0,n) #define rep2(i,m,n) for(int i=m;i<(n);i++) #define pb push_back #define pf push_front #define sec second #define sz(x) ((int)(x).size()) #define ALL( c ) (c).begin(), (c).end() #define gcd(a,b) __gcd(a,b) #define mem(x,n) memset(x,n,sizeof(x)) #define endl "\n" using namespace std; template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){} template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); deploy<POS + 1, TUPLE, Ts...>(os, t); } template <class T,class U> std::ostream& operator<<(std::ostream &os, std::pair<T,U> &p){ os << "(" << p.first <<", " << p.second <<")";return os; } template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; } template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; } template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; } #define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; } #define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); } #define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); } #define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); } using ll = long long; pair <ll,ll> nums[1010]; int N; inline ll calc(ll x){ ll maxs = nums[0].fir + nums[0].sec * x ; ll mins = maxs; rep(i,N){ ll y = nums[i].fir + nums[i].sec * x; maxs = max(maxs,y); mins = min(mins,y); } return maxs - mins; } int main() { cin.tie(0); ios_base::sync_with_stdio(0); cin >> N; rep(i,N){ cin >> nums[i].fir >> nums[i].sec; } ll lp = 1; ll up = INF; while (up - lp >= 10) { ll div1 = (up - lp) / 3 + lp; ll div2 = 2 * (up - lp) /3 + lp; ll x1 = calc(div1); ll x2 = calc(div2); if (x1 > x2){ lp = div1; }else{ up = div2; } } //DEBUG2(lp,up); ll now = calc(max(lp-10,1LL)); int ans = max(lp-10,1LL); for (ll x = max(1LL,lp-10); x <= up+10;x++) { ll y = calc(x); if (now > y) { ans = x; now = y; } } cout << ans << endl; return 0; }