#include <bits/stdc++.h>
#define pb push_back
#define pf push_front
using namespace std;
#define F first
#define S second
typedef long long ll;
#define pii pair <int, int>
#define pll pair <ll, ll>
typedef long double ld;
const ll N = 5 * 1e5 + 100, M = 500 + 10, len = 315, inf = 1e18;
const ll mod = 998244353;
ll um(ll a, ll b){
return (1LL * a * b) % mod;
}
ll subr(ll a, ll b){
return ((1LL * a - b) % mod + mod) % mod;
}
ll bp(ll x, ll step){
ll res = 1;
while(step){
if(step & 1) res = um(res, x);
x = um(x, x);
step /= 2;
}
return res;
}
ll inv(ll x){
return bp(x, mod - 2);
}
ll a[N];
int main() {
//ios_base::sync_with_stdio(false);
//cin.tie(nullptr);
//cout.tie(nullptr);
int n;
cin >> n;
for(int i = 0; i < n; i++){
cin >> a[i];
}
ll prev = 0, cur = 0, mx = 0;
queue <ll> q;
for(int j = 0; j < n; j++){
cur += a[j];
q.push(a[j]);
if(cur >= prev){
while(true){
ll v = q.front();
if(prev + v <= cur - v){
prev += v;
cur -= v;
q.pop();
} else break;
}
while((int)q.size() != 0){
q.pop();
}
prev = cur;
cur = 0;
mx++;
}
}
cout << mx;
return 0;
}
