#include <bits/stdc++.h>
 #define ll long long
 #define ull unsigned long long
 #define pi 3.141592654
 #define NUM 1e18
 #define Mod  1'000'000'007
 #define fixed(n) fixed<<setprecision(n)
 #define cin(v) for(auto &i:v) cin >> i ;
 #define cout(v) for(auto &i:v) cout << i  <<" ";
 #define vowel(x) (x=='e'||x=='a'||x=='i'||x=='o'||x=='u')
 #define small(x) (x>=97&&x<=122)
 #define capital(x) (x>=65&&x<=90)
 #define Tolower(s) transform(s.begin(),s.end(),s.begin(),::tolower);
 #define Toupper(s) transform(s.begin(),s.end(),s.begin(),::toupper);
 #define all(v) ((v).begin()), ((v).end())
 #define allr(v) ((v).rbegin()), ((v).rend())
 #define updmax(a,b) a=max(a,b)
 #define updmin(a,b) a=min(a,b)
 #define ceil(a,b) ((a/b)+(a%b?1:0))
 /* asc -> 1 2 3 ,des -> 3 2 1 */
 /***********************************************************************************/
 using namespace std;
 void Rofyda_Elghadban(){
  #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
   #endif
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
 }

 struct com{
  bool operator()(int l,int r){
    return (l>=50)<(r>=50);
  }
 };

 void solve(){
  int n,sum=0,counter=0,e=0,maxi1=INT_MIN,maxi2=INT_MIN,ans=0;
  cin>>n;
  vector<int>v(n),m,p;
  cin(v);
  for(int i=0;i<n;i++){
    for(int j=i;j<n;j++){
      sum+=v[j];
      if(sum<0){
        maxi1=max(maxi1,ans);
        sum=0;
        ans=0;
      }else{
        ans++;
      }
    }
    for(int k=0;k<i;k++){
      sum+=v[k];
      if(sum<0){
        maxi2=max(maxi2,ans);
        sum=0;
        ans=0;
      }else{
        ans++;
      }
    }
  }
  if((maxi1+maxi2)>n){
    cout<<(maxi1+maxi2)/2<<"\n";
  }else{
    cout<<maxi1+maxi2<<"\n";
  }
 }

 int main(){
  Rofyda_Elghadban();
  solve();

  return 0;
 }