#include<bits/stdc++.h>
using namespace std;
struct qu{
    int a,b,he;
}q[200005];
bool cmp(qu a,qu b){
    if(a.he==b.he){
        return a.a>b.a;
    }
    return a.he>b.he;
}
int main(){
    int n,ans=0,sum=0,num=0;
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>q[i].a>>q[i].b;
        q[i].he=q[i].a+q[i].b;
        sum+=q[i].a;
    }
    sort(q,q+n,cmp);
    for(int i=0;ans<=sum;i++){
        num++;
        ans+=q[i].he;
        sum-=q[i].a;
    }
    cout<<num<<endl;
    return 0;
}