#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n,s=0,b[110]={0},max=INT_MIN;
    cin>>n;
    int a[110];
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        s=s+a[i];
        b[i]=s;
    }
    for (int i=1;i<=n;i++)
    {
        for (int j=1;j<=n-i+1;j++)
        {
            if (b[j+i-1]-b[j-1]>max) max=b[j+i-1]-b[j-1];
        }
    }
    cout<<max<<endl;
    return 0;
}

/**************************************************************
	Problem: 1589
	User: admin
	Language: C++
	Result: Accepted
	Time:53 ms
	Memory:2072 kb
****************************************************************/