#include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define int long long

const int maxn = 100500;
int a[maxn];
int pref[maxn];
int mn[maxn];

void solve() {
    int n;
    cin >> n;
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    int s = 0;
    int ans = 0;
    for (int i = 0; i < n; ++i) {
        s += a[i];
        mn[i + 1] = min(mn[i], s);
        int l = -1;
        int r = i + 1;
        while (r - l > 1) {
            int m = (l + r) / 2;
            if (s - mn[m] > 0)
                r = m;
            else
                l = m;
        }
        ans = max(ans, i - r + 1);
    }
    cout << ans << '\n';
}

signed main() {
    ios::sync_with_stdio(0); cin.tie(0);
    solve();
}