#include<iostream>
using namespace std;
bool NoInput = false;
int find(int *a, int size) {
if ((a == nullptr) || (size <= 0))
{
NoInput = true;
return 0;
}
int nCursum = 0;
int nMaxsum = 0;
for (int i = 0; i < size; ++i) {
if (nCursum <= 0)
nCursum = a[i];
else
nCursum = nCursum + a[i];
if (nCursum > nMaxsum)
nMaxsum = nCursum;
}
return nMaxsum;
}
int main() {
int a[10000];
int i = 0;
int tmp;
while (cin >> tmp)
{
a[i] = tmp;
i++;
}
cout << find(a, i);
return 0;
}