#include <bits/stdc++.h>

using namespace std;

ifstream fin("ssm.in");
ofstream fout("ssm.out");

int n,sum[6000050],a[6000050], best[6000050];
int bestSum,mini;



int main()
{
    int i;
    fin>>n;
    for(i=1; i<=n; ++i)
        fin>>a[i];

    sum[0] = 0;
    for (i = 1; i <= n; i++) sum[i] = a[i] + sum[i-1];
    mini = sum[0];
    bestSum = -2000000000;
    for (i = 1; i <= n; i++)
    {
        best[i] = sum[i] - mini;
        if (mini > sum[i]) mini = sum[i];
        if (bestSum < best[i]) bestSum = best[i];
    }
    fout<<bestSum<<"\n";


    return 0;
}