#include <iostream>
using namespace std;

int main(){
    int n ,v[1000],i,dp[1000],start[1000],maxi;
    cin>>n;
    for (i=1; i<=n; ++i)
        cin>>v[i];
    dp[1]=v[1];
    start[1]=1;
    for (i=2; i<n; ++i){
        if(dp[i-1]>0){
            dp[i]=v[i]+dp[i-1];
            start[i]=start[i-1];
        } else {dp[i]=v[i];
            start[i]=i;
          }
    }
    if (dp[i]>dp[maxi])
        maxi=i;
    return 0;
}