#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fr first
#define sc second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pw(x) (1ll << x)
#define sz(x) (int)((x).size())
#define pb push_back
#define endl '\n'
#define mp make_pair
#define vec vector
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef unsigned long long ull;
template <typename T> inline bool umin (T &a, const T &b) { if (a > b) { a = b; return 1; } return 0; }
template <typename T> inline bool umax (T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template <typename T>
using oset = tree<T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;
struct st {
int n; vector <ll> t;
st (int n = 0) : n(n), t(4 * n, 1e18) {}
inline void upd (int v, int tl, int tr, int pos, ll x) {
if (tl == tr) { t[v] = x; return; }
int tm = (tl + tr) >> 1;
if (pos <= tm) upd(v << 1, tl, tm, pos, x);
else upd(v << 1 | 1, tm + 1, tr, pos, x);
t[v] = min(t[v << 1], t[v << 1 | 1]);
}
inline int get (int v, int tl, int tr, ll x) {
if (tl == tr) return tl;
int tm = (tl + tr) >> 1;
if (t[v << 1 | 1] <= x) return get(v << 1 | 1, tm + 1, tr, x);
else return get(v << 1, tl, tm, x);
}
inline ll getp (int v, int tl, int tr, int pos) {
if (tl == tr) return t[v];
int tm = (tl + tr) >> 1;
if (pos <= tm) return getp(v << 1, tl, tm, pos);
else return getp(v << 1 | 1, tm + 1, tr, pos);
}
inline void upd (int pos, ll x) { upd(1, 0, n - 1, pos, x); }
inline int get (ll x) { return get(1, 0, n - 1, x); }
inline ll getp (int i) { return getp(1, 0, n - 1, i); }
};
inline void solve () {
int n; cin >> n;
st s (n + 1); s.upd(0, 0);
ll sum = 0;
vector <int> dp (n + 1); dp[0] = 0;
vector <ll> pref (n + 1);
for (int i = 1; i <= n; ++i) {
int x; cin >> x; sum += x;
int p = s.get(sum);
dp[i] = dp[p] + 1; pref[i] = sum;
s.upd(i, sum * 2 - pref[p]);
}
assert(dp[n] <= 40);
cout << dp[n];
}
signed main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t = 1; // cin >> t;
while (t--) solve();
return 0;
}
