/**
____ ____ ____ __________________ ____ ____ ____
||I || ||c || ||e || || || ||M || ||a || ||n ||
||__|| ||__|| ||__|| ||________________|| ||__|| ||__|| ||__||
|/__\| |/__\| |/__\| |/________________\| |/__\| |/__\| |/__\|
*/
#include <iostream>
#include <chrono>
#include <vector>
#include <algorithm>
#define maxn 100005
#define maxlog 20
#define INF 1000000010
#define LINF 1000000000000000005
#define endl '\n'
#define pb(x) push_back(x)
#define X first
#define Y second
#define control cout<<"passed"<<endl;
using namespace std;
typedef pair <int, int> pii;
typedef long long ll;
typedef pair <ll, ll> pll;
typedef pair <int, ll> pil;
typedef pair <ll, int> pli;
typedef long double ld;
int n;
int a[maxn];
pll dp[maxn];
ll pref[maxn];
ll minn[maxn];
void read()
{
cin >> n;
for(int i = 1; i <= n; i++)
cin >> a[i];
dp[1] = {1, a[1]};
minn[1] = a[1] + a[1];
pref[0] = 0;
for(int i = 1; i <= n; i++)
pref[i] = pref[i - 1] + a[i];
for(int i = 2; i <= n; i++)
{
dp[i] = {dp[i - 1].X, dp[i - 1].Y + a[i]};
int l = 1, r = n - 1;
int pos = -1;
while(l <= r)
{
int mid = (l + r) / 2;
if(minn[mid] <= pref[i])
l = mid + 1, pos = mid;
else
r = mid - 1;
}
if(pos == -1)
dp[i] = {dp[i - 1].X, dp[i - 1].Y + a[i]};
else
dp[i] = {dp[pos].X + 1, pref[i] - pref[pos]};
minn[i] = min(dp[i].Y + pref[i], minn[i - 1]);
}
//for(int i = 1; i <= n; i++)
// cout << dp[i].X << " " << dp[i].Y << endl;
cout << dp[n].X << endl;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
read();
return 0;
}
