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

int SSM(int n, vector<int> &v) {

    int last = v[0];
    int best = v[0];

    for (int i = 1; i < n; i++) {
        last = max(v[i], last + v[i]);
        best = max(best, last);
    }
        
    return best;
}

int main() {
    ifstream fin("ssm.in");
    ofstream fout("ssm.out");

    int n, i;
    fin >> n;    
    vector<int> v(n + 1);
    for (int i = 0; i < n; i++)
        fin >> v[i];
    fout << SSM(n, v);
    return 0;
}