#include <bits/stdc++.h>

#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)

#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)

#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)
#define clr(a,b) memset((a),(b),sizeof(a))
#define bit(n) (1LL<<(n))
#define popcount(n) (__builtin_popcountll(n))

using namespace std;

template<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}
template<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}

using ll=long long;
using R=long double;
const R EPS=1e-9L; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7
inline int sgn(const R& r){return(r > EPS)-(r < -EPS);}
inline R sq(R x){return sqrt(max(x,0.0L));}

const int dx[8]={1,0,-1,0,1,-1,-1,1};
const int dy[8]={0,1,0,-1,1,1,-1,-1};

// Problem Specific Parameter:

int n;

const int m=1<<19;
const int limit=100000;
vector<int> group[limit+10];

ll data[2*m];
ll lazy[2*m];
ll num[2*m];

inline void lazy_eval(int k){
	data[2*k+1]+=num[2*k+1]*lazy[k];
	data[2*k+2]+=num[2*k+2]*lazy[k];
	lazy[2*k+1]+=lazy[k];
	lazy[2*k+2]+=lazy[k];
	lazy[k]=0;
	return;
}

void dec(int a=0,int b=n,int k=0,int l=0,int r=m){
	if(b<=l or r<=a) return;

	if(a<=l and r<=b){
		data[k]-=num[k];
		lazy[k]--;
		return;
	}

	lazy_eval(k);

	const int m=(l+r)/2;
	dec(a,b,2*k+1,l,m);
	dec(a,b,2*k+2,m,r);

	data[k]=data[2*k+1]+data[2*k+2];
	num[k]=num[2*k+1]+num[2*k+2];
}

void update(int p,ll x, int k=0,int l=0,int r=m){
	const int a=p,b=p+1;
	
	if(b<=l or r<=a) return;

	if(a<=l and r<=b){
		data[k]+=x;
		num[k]=1;
		return;
	}

	lazy_eval(k);

	const int m=(l+r)/2;
	update(p,x,2*k+1,l,m);
	update(p,x,2*k+2,m,r);

	data[k]=data[2*k+1]+data[2*k+2];
	num[k]=num[2*k+1]+num[2*k+2];
}

using state=tuple<ll,ll>;
state query(int a,int b,int k=0,int l=0,int r=m){
	if(b<=l or r<=a) return state(0LL,0LL);

	if(a<=l and r<=b) return state(data[k],num[k]);

	lazy_eval(k);

	const int m=(l+r)/2;
	state ql=query(a,b,2*k+1,l,m);
	state qr=query(a,b,2*k+2,m,r);

	return state(get<0>(ql)+get<0>(qr),get<1>(ql)+get<1>(qr));
}

int upper_bound(){
	int lb=0,ub=n+1;
	while(ub-lb>1){
		const int mid=(lb+ub)/2;
		state cur=query(0,mid);
		if(get<0>(cur)>=0)
			lb=mid;
		else
			ub=mid;
	}
	//cout << "Sum: " <<  get<0>(query(0,lb)) << endl;
	return get<1>(query(0,lb));
}

int main(void){
	cin >> n;
	vector<int> a(n),b(n);
	rep(i,n) cin >> a[i] >> b[i];

	{
		using tii=tuple<int,int>;
		vector<tii> ary;
		rep(i,n) ary.push_back(tii(a[i],b[i]));
		sort(begin(ary),end(ary));
		//sort(rbegin(ary),rend(ary));
		rep(i,n) tie(a[i],b[i])=ary[i];
	}

	rep(i,n) group[b[i]].push_back(i);

	int ans=0;
	rrep(i,limit+1,1){
		dec();
		//cout << "DEC" << endl;
		for(auto &it:group[i]) update(it,b[it]-a[it]);
		//cout << "UPDATE" << endl;
		//cout << i << " " << upper_bound() << endl;
		//cout << i << " " << upper_bound() << endl;
		chmax(ans,upper_bound());
		//cout << "UPPER_BOUND" << endl;
	}

	cout << ans << endl;
	return 0;
}

Measured memory_bytes: 25044