#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
  int N;cin>>N;
  int D;
  vector<int> vg1,vb1;
  for(int i=0;i<N;++i){
    cin>>D;
    if(D>0) vg1.push_back(D);
    else if(D<0) vb1.push_back(D*-1);
  }
  int L=100,LM=100,LP=100;
  sort(vg1.begin(),vg1.end());
  sort(vb1.begin(),vb1.end(),greater<int>());
  while(1){
    vector<int> vbp1;
    for(int i=0;i<vb1.size();++i){
      int a=vb1[i];
      if(L>a){
        L-=a;
        vbp1.push_back(i);
      }
    }
    if(L==LP && vb1.size()!=0 && vg1.size()==0){
      L=0;
      break;
    }
    int cnt_b=0;
    for(int i=0;i<vbp1.size();++i){
      int b=vbp1[i];
      vb1.erase(vb1.begin()+b-cnt_b);
      LM+=100;
      cnt_b+=1;
    }
    LP=L;
    vector<int> vgp1;
    for(int i=0;i<vg1.size();++i){
      int c=vg1[i];
      if(LM>=L+c){
        L+=c;
        vgp1.push_back(i);
      }
    }
    if(L==LP && vb1.size()!=0 && vg1.size()!=0){
      for(int i=0;i<vg1.size();++i){
        int c=vg1[i];
        if(LM>L){
          L=min(LM,L+c);
          vgp1.push_back(i);
        }
      }
    }
    if(L==LP && vb1.size()==0 && vg1.size()!=0){
      for(int i=0;i<vg1.size();++i){
        int e=vg1[i];
        L=max(LM,L+e);
      }
      break;
    }
    int cnt_g=0;
    for(int i=0;i<vgp1.size();++i){
      int d=vgp1[i];
      vg1.erase(vg1.begin()+d-cnt_g);
      cnt_g+=1;
    }
    LP=L;
    if(vb1.size()==0 && vg1.size()==0) break;
  }
  cout<<L<<endl;
}