#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)
#define FORR(I,A,B) for(ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x,t,f) ((x)?(t):(f))
#define SORT(x) (sort(x.begin(),x.end())) // 0 2 2 3 4 5 8 9
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin()) //xi>=v  x is sorted
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin()) //xi>v  x is sorted
#define NUM(x,v) (POSU(x,v)-POSL(x,v))  //x is sorted
#define REV(x) (reverse(x.begin(),x.end())) //reverse
ll gcd_(ll a,ll b){if(a%b==0)return b;return gcd_(b,a%b);}
ll lcm_(ll a,ll b){ll c=gcd_(a,b);return ((a/c)*b);}
#define NEXTP(x) next_permutation(x.begin(),x.end())
const ll INF=ll(1e16)+ll(7);
const ll MOD=1000000007LL;
#define out(a) cout<<fixed<<setprecision((a))
//tie(a,b,c) = make_tuple(10,9,87);
#define pop_(a) __builtin_popcount((a))
ll keta(ll a){ll r=0;while(a){a/=10;r++;}return r;}
#define num_l(a,v) POSL(a,v) //v未満の要素数
#define num_eql(a,v) POSU(a,v) //v以下の要素数
#define num_h(a,v) (a.size() - POSU(a,v)) //vより大きい要素数
#define num_eqh(a,v) (a.size() - POSL(a,v)) //v以上の要素数




int main(){
	ll N;
	cin >> N;
	ll sumA = 0;
	vector<ll> A(N);
	FOR(i,0,N){
		ll a,b;
		cin >> a >> b;
		sumA += a;
		A[i] = a*2+b;
	}
	SORT(A);
	REV(A);

	FOR(i,0,N){
		sumA -= A[i];
		if(sumA<0){
			cout << i+1 << endl;
			return 0;
		}
	}

}

#include<iostream>
#include<vector>
#include<algorithm>
long long N,A,B,p=0LL;
using namespace std;
int main(){
    cin>>N;
    vector<long long>town(N);
    for(int i=0;i<N;i++){cin>>A>>B;p-=A;town[i]=A*2+B;}
    sort(town.rbegin(),town.rend());
    for(int i=0;i<N;p+=town[i],i++)if(p>0LL){cout<<i<<endl;return 0;}
    cout<<N<<endl;
    return 0;
}