code

#include <iostream>
#include <list>
using namespace std;
typedef long long ll;
int main(void){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    ll n;
    cin>>n;
    ll minsum[n];
    list<ll>b;
    ll arr[n];
    ll c;
    for(ll i=0;i<n;i++){
        cin>>arr[i];
        if(c < 1){
        }
        b.push_back(arr[i]);
    }
    ll temp;
    temp = b.front();
    b.pop_front();
    b.push_back(temp);
    ll i=1;
    ll f=0;
    ll maxs = 100000000;
    while(i <= n){
        f+=b.front();
        b.pop_front();
        if(maxs > f){
            maxs = f;
        }
        i++;
    }
    ll o=0;
    minsum[n-1] = maxs;
    if(maxs >=0){
        o++;
    }
    for(int i=n-2;i>=0;i--){
        ll k=0;
        minsum[i] = arr[i] + min(k,minsum[i+1]);
        if(minsum[i] >= 0){
                o++;
        }
    }
    cout<<o;
}