#include <fstream>
#include <iostream>
#include <cstring>
//6000001
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
    int n,a[6000001],best[6000001],bestSum=0,i=0;
    fin>>n;
    memset(best,0,sizeof(best));
    memset(a,0,sizeof(a));
    for(i=1;i<=n;i++)
    {
        fin>>a[i];
    }
    bestSum=a[1];
    for (i=1;i<n;++i)
    {
        best[i]=a[i];
        if (best[i]<best[i-1]+a[i])
            best[i]=best[i-1]+a[i];
        if (bestSum<best[i])
            bestSum=best[i];
    }
    fout<<bestSum;
    return 0;
}