#include <bits/stdc++.h>
using namespace std;

int main() {
	int N;
	cin >> N;
	vector<int> L(N), R(N);
	for(int i = 0; i < N; ++i) cin >> L[i] >> R[i];
	
	const int INF = (1 << 30);
	for(int i = 0; i < N; ++i) while(R[i] * 2 < INF) L[i] *= 2, R[i] *= 2;
	
	vector<pair<int, int>> E;
	for(int i = 0; i < N; ++i) {
		if(INF / 2 <= L[i]) E.emplace_back(L[i], 1);
		else E.emplace_back(INF / 2, 1), E.emplace_back(L[i] * 2, 1), E.emplace_back(INF, -1);
		E.emplace_back(R[i], -1);
	}
	sort(E.begin(), E.end());
	
	int ans = 0, cnt = 0;
	for(auto [_, val] : E) {
		cnt += val;
		ans = max(ans, cnt);
	}
	
	cout << ans << "\n";
}