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;
long long int abss(long long int a) {
  if (a < 0) return -a;
  return a;
}
long long int fast_pow(long long int b, long long int e,
                       long long int width = 1000000007) {
  if (e == 0) {
    return 1;
  } else if (e == 1) {
    return b % width;
  }
  b = b % width;
  long long int ans = 1;
  while (e > 0) {
    if ((e & 1) == 1) {
      ans = (ans * b) % width;
    }
    e >>= 1;
    b = (b * b) % width;
  }
  return ans;
}
long long int mod_inv(long long int a, long long int width = 1000000007) {
  return fast_pow(a, width - 2, width);
}
template <typename Number, Number width>
class ModularArithmetic {
 private:
  Number n;

 public:
  friend ostream &operator<<(ostream &os, ModularArithmetic const &num) {
    return os << num.n;
  }
  friend istream &operator>>(istream &is, ModularArithmetic &num) {
    is >> num.n;
    return is;
  }
  ModularArithmetic() : n(0) {}
  ModularArithmetic(Number n) : n(n % width) {
    if (this->n < 0) this->n += width;
  }
  Number get() const { return n; }
  ModularArithmetic operator+(const ModularArithmetic &b) {
    Number t = (n + b.get()) % width;
    if (t < 0) return ModularArithmetic(width + t);
    return ModularArithmetic(t);
  }
  ModularArithmetic operator-(const ModularArithmetic &b) {
    Number t = (n - b.get()) % width;
    if (t < 0) return ModularArithmetic(width + t);
    return ModularArithmetic(t);
  }
  ModularArithmetic operator*(const ModularArithmetic &b) {
    Number t = (n * b.get()) % width;
    if (t < 0) return ModularArithmetic(width + t);
    return ModularArithmetic(t);
  }
  ModularArithmetic operator/(const ModularArithmetic &b) {
    assert(b.get() != 0);
    Number ans = n * mod_inv(b.get(), width);
    if ((ans) < 0) return ModularArithmetic(width + (ans) % width);
    return ModularArithmetic(ans % width);
  }
  ModularArithmetic &operator+=(const ModularArithmetic &b) {
    n = (n + b.get()) % width;
    if (n < 0) n = n + width;
    return *this;
  }
  ModularArithmetic &operator-=(const ModularArithmetic &b) {
    n = (n - b.get()) % width;
    if (n < 0) n = n + width;
    return *this;
  }
  ModularArithmetic &operator*=(const ModularArithmetic &b) {
    n = (n * b.get()) % width;
    if (n < 0) n = n + width;
    return *this;
  }
  ModularArithmetic &operator/=(const ModularArithmetic &b) {
    assert(b.get() != 0);
    n = (n * mod_inv(b.get(), width)) % width;
    if (n < 0) n = n + width;
    return *this;
  }
};
template <class S, class T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
  return os << "(" << p.first << "," << p.second << ")";
}
template <class T>
ostream &operator<<(ostream &os, const vector<T> &p) {
  os << "[";
  for (auto &it : p) os << it << " ";
  return os << "]";
}
template <class T>
ostream &operator<<(ostream &os, const set<T> &p) {
  os << "[";
  for (auto &it : p) os << it << " ";
  return os << "]";
}
template <class T>
ostream &operator<<(ostream &os, const multiset<T> &p) {
  os << "[";
  for (auto &it : p) os << it << " ";
  return os << "]";
}
template <class S, class T>
ostream &operator<<(ostream &os, const map<S, T> &p) {
  os << "[";
  for (auto &it : p) os << it << " ";
  return os << "]";
}
template <class S, class T>
istream &operator>>(istream &is, const pair<S, T> &p) {
  return is >> p.first >> p.second;
}
template <class T>
istream &operator>>(istream &is, vector<T> &p) {
  for (auto &itr : p) is >> itr;
  return is;
}
template <class T>
void dbs(string str, T t) {
  cerr << str << ":" << t << "\n";
}
template <class T, class... S>
void dbs(string str, T t, S... second) {
  long long int idx = str.find(',');
  cerr << str.substr(0, idx) << ":" << t << ",";
  dbs(str.substr(idx + 1), second...);
}
long long int n;
vector<long long int> arr;
vector<long long int> dp;
long long int kadane(vector<long long int> &A) {
  long long int N = A.size();
  vector<long long int> dp(N, 0);
  dp[0] = A[0];
  for (long long int i = 1; i < N; ++i) {
    dp[i] = max(A[i], A[i] + dp[i - 1]);
  }
  long long int mx = dp[0];
  for (long long int i = 0; i < N; ++i)
    if (dp[i] > mx) mx = dp[i];
  return mx;
}
void solve() {
  cin >> n;
  vector<long long int>(n).swap(arr);
  for (long long int i = 0; i < n; ++i) cin >> arr[i];
  long long int ans;
  for (long long int val = -30; val < 31; ++val) {
    vector<long long int> temp = arr;
    for (long long int i = 0; i < n; ++i)
      if (temp[i] > val) temp[i] = -10000000;
    if (val == -30) {
      ans = kadane(temp) - val;
    } else {
      long long int tt = kadane(temp) - val;
      if (tt > ans) {
        ans = tt;
      }
    }
  }
  cout << ans << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  solve();
  return 0;
}
