# pragma GCC optimize("Ofast")
# pragma GCC optimization ("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forn(i,a,b) for (int i = a; i <= b; i++)
#define fi(i,a,b) for (int i = a; i < b; i++)
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define rc(s) return cout<<s,0
#define er erase
#define in insert
#define pi pair <int, int>
#define pii pair <pi, pi>
# define sz(x) (int)((x).size())

int bsum=INT_MIN,n;

int32_t main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	ifstream cin("ssm.in");
	ofstream cout("ssm.out");
	cin>>n;  int x,ind=1,sum=0,beg,endd;
	forn(i,1,n){
		cin>>x;
		if(sum<0){
			sum=x;
			ind=i;
		}else sum+=x;
			if(bsum<sum){
				bsum=sum;
				beg=ind;
				endd=i;
			}		
	}
	cout<<bsum;
	
return 0;
}