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

import java.io.*;
import java.math.BigInteger;
import java.util.*;




public class Main {
	

	public static class FastReader {
		BufferedReader br;
		StringTokenizer root;
		
 
		public FastReader() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}
 
		String next() {
			while (root == null || !root.hasMoreTokens()) {
				try {
					root = new StringTokenizer(br.readLine());
				} catch (Exception addd) {
					addd.printStackTrace();
				}
			}
			return root.nextToken();
		}
 
		int nextInt() {
			return Integer.parseInt(next());
		}
 
		double nextDouble() {
			return Double.parseDouble(next());
		}
 
		long nextLong() {
			return Long.parseLong(next());
		}
 
		String nextLine() {
			String str = "";
			try {
				str = br.readLine();
			} catch (Exception addd) {
				addd.printStackTrace();
			}
			return str;
		}
	}
	
	public static PrintWriter out = new PrintWriter (new BufferedOutputStream(System.out));
	
	public static FastReader sc = new FastReader();
 
	static int mod = (int) (1e9+7),MAX=(int) (2e5);
    static List<Integer>[] edges;
    
	public static void main(String[] args){
      
	  int n = sc.nextInt();
	  int[] a = new int[n];
	  for(int i=0;i<n;++i) a[i] = sc.nextInt();
	  
	  long[] p = pref(a);
	  long[] s = suff(a);
	  int[] right = nge(a,n);
	  int[] left = pge(a,n);
	  
	  SegmentTree pref = new SegmentTree(p,n);
	  SegmentTree suff = new SegmentTree(s,n);

	  long max = Integer.MIN_VALUE;
	  for(int i=0;i<n;++i) {
		  int l = left[i]+1;
		  int r = right[i]-1;
		
		  long ll=0,rr=0;
		  if(i-1 >= 0 && l <= i-1) ll = Math.max(0,suff.query(s, l, i-1) - s[i]);
		  if(i+1 < n && i+1 <= r) rr = Math.max(0,pref.query(p, i+1, r) - p[i]);
		  
		  max = Math.max(max,ll+rr);
	  }
	  out.print(max);
	 
      out.close();
	}
	
	
	public static class SegmentTree 
	{ 
		long seg[];  
 
		SegmentTree(long[] a, int n) { 
			seg = new long[4*n];
			buildTree(a,0,n-1,1);
		} 
		
		public void buildTree(long[] a, int start, int end, int i) {
			if(start == end) {
				seg[i] = a[start];
				return;
			}
			int mid = start +(end-start)/2;
			buildTree(a,start,mid,2*i);
			buildTree(a,mid+1,end,2*i+1);
			
			seg[i] = Math.max(seg[2*i] , seg[2*i+1]);
			
		}
 
		public long query(long[] a, int l,int r) {
			return query(0,a.length-1,1,l,r);
		}
		
		public long query(long m, long mid2, int i, int l, int r) {
			// OUTSIDE
			if(m>r || mid2<l)
				return Integer.MIN_VALUE; // depend on q
			//INSIDE
			if(m>=l && mid2<=r)
				return seg[i];
			// PARTIAL
			long mid = m+(mid2-m)/2;
			long ansl = query(m,mid,2*i,l,r);
			long ansr = query(mid+1,mid2,2*i+1,l,r);
			
			return Math.max(ansl,ansr);
			
		}
 
		public void update(long[] a,int idx,long ans) {
			updateTree(a,0,a.length-1,1,idx,ans);
		}
		public void updateTree(long[] a,int start, int end, int i, int idx, long ans) {
			if(start == end) {
				a[idx] = ans;
				seg[i] = ans;
				return;
			}
			
			int mid = start+(end-start)/2;
			if(idx>mid)
				updateTree(a,mid+1,end,2*i+1,idx,ans);
			else updateTree(a,start,mid,2*i,idx,ans);
			
			seg[i] = Math.max(seg[2*i], seg[2*i+1]);
			
		}
 
	}

	 static void rev(int arr[]){
		 int start=0, end=arr.length;
	        int temp; 
	        while (start < end) { 
	            temp = arr[start]; 
	            arr[start] = arr[end]; 
	            arr[end] = temp; 
	            start++; 
	            end--; 
	        } 
	    } 
	 
	 static int[] nge(int arr[], int n){  
		 /*
		  * return indices( 0 based ) of Next greater elements 
		  */
		    Stack<Integer> s = new Stack<Integer>();  
		    int arr1[] = new int[n];
		    for (int i = n - 1; i >= 0; i--){  
		        while (!s.isEmpty() && arr[s.peek()] <= arr[i]) s.pop();  
		        if (s.empty()) arr1[i] = n; // or -1 to show No nge          
		        else arr1[i] = s.peek();          
		        s.push(i);  
		    }  
		  return arr1;
	}  
	 
	 static int[] pge(int arr[],int n) {
		 /*
		  * return indices( 0 based ) of Previous greater elements 
		  */
		 int[] ans = new int[n];
		 int ptr = 0;
		 Stack<Integer> s = new Stack<>();
		 s.push(0);
		 ans[ptr++] = -1; // for first No pge is present
		 for(int i=1;i<n;++i) {
			 while(s.size() > 0 && arr[s.peek()] < arr[i]) s.pop();
			 if(s.size() == 0) ans[ptr++] = -1;
			 else ans[ptr++] = s.peek();
			 s.push(i);
		 }
		 return ans;
	 }
	 
	 static long[] pref(int[] a) {
		 int n = a.length;
		 long[] pre = new long[n];
		 pre[0] = a[0];
		 for(int i=1;i<n;++i) pre[i] = pre[i-1] + a[i];
		 return pre;
	 }
	 
	 static long[] suff(int[] a) {
		 int n = a.length;
		 long[] suff = new long[n];
		 suff[n-1] = a[n-1];
		 for(int i=n-2;i>=0;--i) suff[i] = suff[i+1] + a[i];
		 return suff;
	 }
	

}
