#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
struct node{
    int v;
    node *prev,*next;
    node():prev(NULL),next(NULL){
        
    };
};
node * newnode(){
    return new node();
};
void init(){
    int n,fu=0;
    cin>>n;
    node *shou=newnode();
    cin>>shou->v;
    if (shou->v<0) {
        fu++;
    }
    node *cur=shou;
    for (int i=1; i<n; i++) {
        node *ne=newnode();
        int k;
        cin>>k;
        if (k<0) {
            fu++;
        }
        ne->v=k;
        cur->next=ne;
        ne->prev=cur;
        if (i==n-1) {
            shou->prev=ne;
            ne->next=shou;
        }
    }
    int tot=n;
    cur=shou;
    while (tot>1&&fu) {
        if (cur->v<0) {
            cur->prev->v+=cur->v;
            fu--;
            if (cur->prev<0) {
                fu--;
            }
            cur->prev->next=cur->next;
            cur->next->prev=cur->prev;
            tot--;
        }
        cur=cur->prev;
    }
    cout<<tot;
}
int main(){
    freopen("sumc.in", "r", stdin);
    freopen("sumc.out", "w", stdout);
    init();
}