#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;

int n, a[100010], ans, dt[100010];

int f(int x)
{
    if( x == 0 ) return a[x];
    if( dt[x] ) return dt[x];
    return dt[x] = max( f(x-1)+a[x], a[x] );
}

int main()
{
    ios::sync_with_stdio(0);
    cin>>n;
    for(int i = 0 ; i < n ; i++ ) cin>>a[i];
    for(int i = 0 ; i < n ; i++ ) ans = max( ans, f(i) );
    cout<<ans<<endl;
}