text: #define _CRT_SECURE_NO_WARNINGS
  #include <bits/stdc++.h>
  //#include "temp.cpp"
  #include <cstdio>
  using namespace std;
  
  #ifndef ONLINE_JUDGE
  #define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
  #else
  #define dbg(x)
  #endif
  
  #define sz(x) (int((x).size()))
  #define len(x) (int)x.length()
  #define all(x) (x).begin(), (x).end()
  #define rall(x) (x).rbegin(), (x).rend()
  
  #define pb push_back
  #define popf pop_front
  #define popb pop_back
  
  void print(long long t) {cerr << t;}
  void print(int t) {cerr << t;}
  void print(string t) {cerr << t;}
  void print(char t) {cerr << t;}
  void print(double t) {cerr << t;}
  void print(unsigned long long t) {cerr << t;}
  
  template <class T, class V> void print(pair <T, V> p);
  template <class T> void print(vector <T> v);
  template <class T> void print(set <T> v);
  template <class T, class V> void print(map <T, V> v);
  template <class T> void print(multiset <T> v);
  template <class T> void print(T v[],T n) {cerr << "["; for(int i = 0; i < n; i++) {cerr << v[i] << " ";} cerr << "]";}
  template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
  template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
  template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
  template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
  template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
  
  #include <ext/pb_ds/assoc_container.hpp>
  using namespace __gnu_pbds;
  #define nl '\n'
  
  // for grid problems
  int dx[8] = {-1,0,1,0,1,-1,1,-1};
  int dy[8] = {0,1,0,-1,1,1,-1,-1};
  
  // lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
  void fastIO() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
  }
  // file in/out
  void setIO(string str = "") {
    fastIO();
  
    if (str != "") {
      freopen((str + ".in").c_str(), "r", stdin);
      freopen((str + ".out").c_str(), "w", stdout);
    }
  }
  
  // Indexed Set
  template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
  
  void solve_() {
    int n; cin >> n;
    vector<long long> a(n);
    multiset<long long> mt;
  
    for(int i = 0; i < n; i++) {
      cin >> a[i];
    }
  
    long long curr = 0;
    for(int i = 0; i < n; i++) {
      curr += a[i], mt.insert(a[i]);
      while(curr < 0) {
        curr -= *mt.begin();
        mt.erase(mt.begin());
      }
    }
  
    cout << sz(mt) << endl;
  }
  
  int main () {
    setIO();
  
    auto solve = [&](int test_case)-> void {
      while(test_case--) {
        solve_();
      }
    };
  
    int test_cases = 1;
    solve(test_cases);
  
    return 0;
  }