#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

const int N=1e5+10;

ll dp[N], a[N];
int n;

ll Kadane ()
{
    ll ret=a[1];
    dp[1]=a[1];

    for (int i=2;i<=n;i++)
    {
        dp[i]=max(a[i], a[i]+dp[i-1]);
        ret=max(ret, dp[i]);
    }

    return ret;
}

int main()
{
    scanf ("%d", &n);
    for (int i=1;i<=n;i++) scanf ("%d", &a[i]);

    printf ("%lld", Kadane());

    return 0;
}