#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

typedef long long ll;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    ll n;
    if (!(cin >> n) || n <= 0) return 0;

    vector<ll> b(n);
    for (ll i = 0; i < n; i++) {
        cin >> b[i];
    }

    ll k;
    cin >> k;

    ll maxLen = 0, sum = 0;
    for (ll i = 0, j = 0; j < n; j++) {
        sum += b[j];

        // Ensure window stays valid and sum is <= k
        while (i <= j && sum > k) {
            sum -= b[i];
            i++;
        }

        if (sum <= k) {
            maxLen = max(maxLen, j - i + 1);
        }
    }

    cout << maxLen << "\n";
    return 0;
}