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

int a[200005],s[200005],maxn,minn=2e9;

int main(){
	int n;
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&a[i]);
		s[i]=s[i-1]+a[i];
	}
	for(int i=1;i<=n;i++)
	{
		maxn = max(maxn,s[i]-minn);
		minn = min(minn,s[i]);
	}
	printf("%d\n",maxn);
	return 0;
}