#include <map>
#include <set>
#include <ctime>
#include <cmath>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
#define For(i, x, y) for(int i=x;i<=y;i++)
#define _For(i, x, y) for(int i=x;i>=y;i--)
#define Mem(f, x) memset(f,x,sizeof(f))
#define Sca(x) scanf("%d", &x)
#define Sca2(x,y) scanf("%d%d",&x,&y)
#define Scl(x) scanf("%lld",&x);
#define Pri(x) printf("%d\n", x)
#define Prl(x) printf("%lld\n",x);
#define CLR(u) for(int i=0;i<=N;i++)u[i].clear();
#define LL long long
#define ULL unsigned long long
#define mp make_pair
#define PII pair<int,int>
#define PIL pair<int,long long>
#define PLL pair<long long,long long>
#define pb push_back
#define fi first
#define se second
typedef vector<int> VI;
const double eps = 1e-9;
const int maxn = 1e5 + 10;
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
int N,M,tmp,K;
int a[maxn];
int sum[maxn];
int dp[maxn];
int f[maxn];
int Queue[maxn];
int main()
{int N; Sca(N);  //sum[i - 1] <= sum[j - 1] - dp[j]For(i,1,N){Sca(a[i]);sum[i] = sum[i - 1] + a[i];} int head = 1,tail = 1; Queue[1] = N + 1;_For(i,N,1){while(head < tail && sum[i - 1] <= sum[Queue[head + 1] - 1] - dp[Queue[head + 1]]) head++;dp[i] = sum[Queue[head] - 1] - sum[i - 1];f[i] = f[Queue[head]] + 1;while(head <= tail && sum[i - 1] - dp[i] >= sum[Queue[tail] - 1] - dp[Queue[tail]]) tail--;Queue[++tail] = i;}printf("%d",f[1]);#ifdef VSCodesystem("pause");#endifreturn 0;
}