#include <iostream>
#include <queue>
#include <vector>
using namespace std;

#define int long long

priority_queue<int,vector<int>,greater<int>> q;

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n,i,a,sum=0,cnt=0;
    cin>>n;
    for(i=1;i<=n;i++){
        cin>>a;
        if(a>=0){
            sum+=a;
            cnt++;
        }else{
            q.push(a);
            sum+=a;
            if(sum<0){
                sum-=q.top();
                q.pop();
            }
        }
    }
    cout<<cnt+q.size();
    return 0;
}