10
-3 4 -4 1 1 -4 -5 3 -4 -2
 10
8 9 -10 -10 -4 -3 5 9 -9 9
 6
5 -4 2 -1 2 -2
 11
3 0 1 -2 5 -5 -1 0 3 2 2
 10
4 -2 -2 -2 2 0 1 0 -4 -1
 4
2 2 -3 4
 11
-11 -7 -2 -24 30 -26 24 9 -8 -9 23
 6
30 -29 5 5 -29 30
 24
-8 -6 6 -11 -15 -7 10 -19 -6 21 14 -4 -21 -10 12 17 1 -1 5 19 2 0 -4 -23
 10
-9 -6 -1 9 -2 0 0 -1 5 0
 6
10 -8 3 3 -8 10
 10
-2 -3 -1 4 -3 2 0 1 -5 4
 5
30 -29 10 -1 10
 31
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -29 30
 7
30 -20 5 1 3 -20 30
 5
30 -29 4 -3 4
 10
-5 28 -18 -10 9 -2 11 -6 -19 30
 8
4 -10 13 -13 2 2 -11 6
 131
30 -29 29 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 28 -28 27 -26 27
 10
-4 4 0 -2 3 0 1 2 3 -4
 10
-2 -8 5 4 -1 -6 -9 6 1 -6
 7
25 -17 13 13 -25 25 -24
 10
3 -3 2 1 -4 -2 3 -2 -3 0
 10
4 -5 0 4 0 0 -3 1 1 -4
 10
0 4 4 1 -3 4 2 1 4 -1
 17
15 -13 7 8 8 1 -19 12 8 -23 -4 16 -13 -28 10 -30 -14
 4
1 1 -4 10
 11
3 -2 1 1 1 1 1 1 1 -3 4
 7
30 -29 10 10 10 -29 30
 7
25 -13 17 -23 12 12 9
 7
15 -14 10 10 10 -14 15
 10
3 0 0 -4 3 1 -2 -1 -1 4
 6
8 -7 7 -6 5 5
 10
1 -4 -4 4 -2 -3 3 0 -2 3
 15
1 -26 -6 26 7 10 -2 -4 -6 14 -9 25 9 -12 -28
 6
30 -29 10 10 -29 30
 1
6
 2
1 1
 5
0 5 -4 3 -1
 7
5 -4 3 -1 3 -4 4
 10
16 -15 13 -1 10 -2 -20 26 5 -30
 10
-1 2 0 -1 2 -1 4 3 -5 1
 7
5 -4 1 1 1 -4 5
 5
10 -3 -5 3 5
 10
4 -4 3 -2 3 -4 -2 0 1 0
 10
-5 -5 -3 1 -2 2 0 2 -3 4
 10
2 -4 -2 3 1 1 -2 -1 -3 4
 10
-4 -5 4 -3 2 -2 2 1 -1 0
 10
0 -1 4 -2 3 -2 -1 -5 -5 2
 5
19 -6 1 -11 19
 10
1 0 -4 3 -5 3 -1 2 2 -5
 7
5 -5 3 4 3 -5 5
 10
-5 2 -3 -3 -4 3 3 0 2 4
 4
2 3 -10 11
 10
27 -17 15 -22 18 17 -6 2 16 -14
 6
30 -22 6 7 -22 30
 7
30 -25 0 6 9 -2 10
 9
7 2 -1 1 1 -10 6 -1 6
 4
1 -10 1 10
 5
17 -16 12 -11 15
 35
-23 -22 23 4 -22 29 -4 -6 -28 18 -5 21 -7 -8 -11 -7 30 -25 -1 12 19 5 -8 12 -1 10 -24 -19 24 -17 -7 24 20 -22 16
 10
4 -3 1 -2 1 1 0 -4 4 -2
 10
4 -2 1 0 1 -5 -2 1 0 -5
 2
3 9
 9
11 -5 -5 1 2 3 -5 -5 11

1
 8
 1
 4
 1
 2
 15
 5
 36
 2
 3
 1
 9
 28
 4
 1
 7
 2
 1
 7
 4
 13
 1
 1
 13
 16
 1
 6
 20
 21
 20
 1
 5
 1
 44
 10
 0
 1
 0
 2
 9
 5
 2
 3
 1
 2
 2
 1
 1
 3
 3
 6
 8
 2
 29
 6
 13
 5
 1
 1
 30
 1
 1
 3
 3

#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;
}
