#include <bits/stdc++.h>
using namespace std;
const int N = 100010;
const int D = 20;
int n;
int a[N], s[N];
int f_min[N][D], f_max[N][D];
inline int smaller(int x, int y) { return s[x] < s[y] ? x : y; }
inline int larger(int x, int y) { return s[x] > s[y] ? x : y; }
int query_min(int x, int y) {
  int det = log2(y - x + 1);
  int res = smaller(f_min[x][det], f_min[y - (1 << det) + 1][det]);
  return res;
}
int query_max(int x, int y) {
  int det = log2(y - x + 1);
  int res = larger(f_max[x][det], f_max[y - (1 << det) + 1][det]);
  return res;
}
const int BASE = 30;
int prefix_pos[N][BASE * 2 + 10], suffix_pos[N][BASE * 2 + 10];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    scanf("%d", a + i);
    s[i] = s[i - 1] + a[i];
    f_min[i][0] = f_max[i][0] = i;
    if (0) printf("%d%c", s[i], " \n"[i == n]);
  }
  for (int j = 1; (1 << j) <= (n + 1); ++j)
    for (int i = 0; i <= n; ++i) {
      f_max[i][j] = f_max[i][j - 1];
      f_min[i][j] = f_min[i][j - 1];
      int nex = i + (1 << (j - 1));
      if (nex > n) break;
      f_max[i][j] = larger(f_max[i][j], f_max[nex][j - 1]);
      f_min[i][j] = smaller(f_min[i][j], f_min[nex][j - 1]);
      if (0)
        printf("f_min[%d][%d]=%d, f_max[%d][%d]=%d\n", i, j, f_min[i][j], i, j,
               f_max[i][j]);
    }
  for (int i = 1; i <= n; ++i) {
    for (int j = 0; j <= BASE * 2; ++j) prefix_pos[i][j] = prefix_pos[i - 1][j];
    prefix_pos[i][a[i] + BASE] = i;
  }
  for (int j = 0; j <= BASE * 2; ++j) suffix_pos[n + 1][j] = n + 1;
  for (int i = n; i; --i) {
    for (int j = 0; j <= BASE * 2; ++j) suffix_pos[i][j] = suffix_pos[i + 1][j];
    suffix_pos[i][a[i] + BASE] = i;
  }
  int ans = 0;
  for (int i = 1; i <= n; ++i) {
    int L = 0, R = n + 1;
    for (int j = a[i] + 1 + BASE; j <= BASE * 2; ++j) {
      L = max(L, prefix_pos[i][j]);
      R = min(R, suffix_pos[i][j]);
    }
    int mi = query_min(L, i - 1);
    int ma = query_max(i, R - 1);
    if (0) printf("query_min: (%d, %d) -> [%d] %d\n", L, i - 1, mi, s[mi]);
    if (0) printf("query_max: (%d, %d) -> [%d] %d\n", i, R - i, ma, s[ma]);
    if (0)
      printf("max=[%d], seg=[%d, %d] res=(%d)-(%d)-(%d)\n", i, mi + 1, ma,
             s[ma], s[mi], a[i]);
    ans = max(ans, s[ma] - s[mi] - a[i]);
  }
  printf("%d\n", ans);
  return 0;
}
