#include <bits/stdc++.h>
#define pb push_back
using namespace std;
#define F first
#define sz size()
#define S second
#define in insert
#define lb lower_bound
#define int long long
#define all(v) v.begin(), v.end()
#define FOR(x, n, m, d) for(int x = n; x <= m; x += d)
#define FORR(x, n, m, d) for(int x = n; x >= m; x -= d)
#define nikita ios_base::sync_with_stdio(0), cin.tie(0);
const int N = 1e6+5;
int n,m,k,tt,ans,sum=0,l, r, x, y, cnt, block = 448, res;
int a[N], b[N], c[N], dp[N], pref[N];
void solve() {
cin >> n;
FOR(i, 1, n, 1){
cin >> a[i];
}
sum = a[1], k = 0;
l = 2;
ans = 1;
FOR(i, 2, n, 1){
k += a[i];
if(k >= sum){
while(l < i){
if(k - a[l] >= sum + a[l])sum += a[l], k -= a[l], l ++;
else break;
}
sum = k;
k = 0;
l = i + 1;
ans ++;
}
}
cout << ans;
}
signed main()
{
nikita
tt = 1;
if(!tt)cin >> tt;
FOR(i, 1, tt, 1){
solve();
}
}
