#include<bits/stdc++.h>

using namespace std;

#define MAXN 100010

int i,n,head,tail;

int a[MAXN],sum[MAXN],q[MAXN],f[MAXN],h[MAXN];

int main()

{

        scanf("%d",&n);

        for (i = ; i <= n; i++)

        {

                scanf("%d",&a[i]);

                sum[i] = sum[i-] + a[i];

        }

        q[] = n + ;

        head = tail = ;

        for (i = n; i >= ; i--)

        {

                while (head < tail && sum[q[head+]-] - f[q[head+]] >= sum[i-]) head++;

                f[i] = sum[q[head]-] - sum[i-];

                h[i] = h[q[head]] + ;

                while (head <= tail && sum[q[tail]-] - f[q[tail]] <= sum[i-] - f[i]) tail--;

                q[++tail] = i;

        }

        printf("%d\n",h[]);

        return ;

}