#include<bits/stdc++.h>
#define LL long long
#define fi first
#define se second
#define mk make_pair
#define pii pair<int,int>
#define piii pair<int, pair<int,int> >
using namespace std;
const int N = 1e5 + 7;
const int inf = 0x3f3f3f3f;
const LL INF = 0x3f3f3f3f3f3f3f3f;
const int mod = (int)1e9 + 7;
const int eps = 1e-6;
int n, a[N], dp[N], cnt[N], st[N], l = 1, r = 1;
LL sum[N];
int main() {
scanf("%d", &n);
for(int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
sum[i] = sum[i - 1] + a[i];
}
cnt[n + 1] = 0;
st[r] = n + 1;
for(int i = n; i >= 1; i--) {
while(r > l && sum[st[l + 1] - 1] - sum[i - 1] >= dp[st[l + 1]]) l++;
dp[i] = sum[st[l] - 1] - sum[i - 1];
cnt[i] = cnt[st[l]] + 1;
while(r >= l && dp[i] - sum[i - 1] < dp[st[r]] - sum[st[r] - 1])
r--;
st[++r] = i;
}
printf("%d\n", cnt[1]);
return 0;
}