#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
int n, a[100005], f[100005], s[100005], ans;
int main()
{
	scanf("%d", &n);
	for(int i = 1; i <= n; i++)
	{
		scanf("%d", &a[i]);
		f[i] = max(a[i], f[i - 1] + a[i]); //f[i]表示以a[i]结尾的最大子段和
		ans = max(ans, f[i]);
	}
	printf("%d", ans);
	return 0;
}