/** author: shobonvip created: 2026.08.25 14:27:49 **/ #include using namespace std; //* ATCODER #include using namespace atcoder; typedef modint998244353 mint; //*/ /* BOOST MULTIPRECISION #include using namespace boost::multiprecision; //*/ typedef long long ll; #define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++) #define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--) #define all(v) v.begin(), v.end() template bool chmin(T &a, const T &b) { if (a <= b) return false; a = b; return true; } template bool chmax(T &a, const T &b) { if (a >= b) return false; a = b; return true; } template T max(vector &a){ assert(!a.empty()); T ret = a[0]; for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]); return ret; } template T min(vector &a){ assert(!a.empty()); T ret = a[0]; for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]); return ret; } template T sum(vector &a){ T ret = 0; for (int i=0; i<(int)a.size(); i++) ret += a[i]; return ret; } void solve() { int n; cin >> n; vector,ll>> mp; auto add = [&](ll si,ll bo,int v) -> void { ll g = __gcd(si,bo); si /= g; bo /= g; mp.emplace_back(pair(si,bo),v); }; ll now = 0; rep(i,0,n) { ll l, r; cin >> l >> r; ll g = 1; while (l > g) g <<= 1; if (r > g && r <= 2*g) { now++; add(r,g,-1); } if (2*l >= g && 2*l <= 2*g) { add(2*l,g,+1); } if (2*r >= g && 2*r <= 2*g) { add(2*r,g,-1); } if (4*l >= g && 4*l <= 2*g) { add(4*l,g,+1); } if (4*r >= g && 4*r <= 2*g) { add(4*r,g,-1); } } sort(all(mp),[&](auto &a, auto &b) { return a.first.first * b.first.second < a.first.second * b.first.first; }); ll ans = now; for (int i=0; i<=n;) { int l = i; ll c = 0; while (mp[l].first == mp[i].first) { c += mp[i].second; i++; } now += c; chmax(ans, now); } cout << ans << endl; } int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); solve(); }