#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;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgojaW5jbHVkZSA8YWxnb3JpdGhtPgoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCnR5cGVkZWYgbG9uZyBsb25nIGxsOwoKaW50IG1haW4oKSB7CiAgICBpb3NfYmFzZTo6c3luY193aXRoX3N0ZGlvKGZhbHNlKTsKICAgIGNpbi50aWUoTlVMTCk7CgogICAgbGwgbjsKICAgIGlmICghKGNpbiA+PiBuKSB8fCBuIDw9IDApIHJldHVybiAwOwoKICAgIHZlY3RvcjxsbD4gYihuKTsKICAgIGZvciAobGwgaSA9IDA7IGkgPCBuOyBpKyspIHsKICAgICAgICBjaW4gPj4gYltpXTsKICAgIH0KCiAgICBsbCBrOwogICAgY2luID4+IGs7CgogICAgbGwgbWF4TGVuID0gMCwgc3VtID0gMDsKICAgIGZvciAobGwgaSA9IDAsIGogPSAwOyBqIDwgbjsgaisrKSB7CiAgICAgICAgc3VtICs9IGJbal07CgogICAgICAgIC8vIEVuc3VyZSB3aW5kb3cgc3RheXMgdmFsaWQgYW5kIHN1bSBpcyA8PSBrCiAgICAgICAgd2hpbGUgKGkgPD0gaiAmJiBzdW0gPiBrKSB7CiAgICAgICAgICAgIHN1bSAtPSBiW2ldOwogICAgICAgICAgICBpKys7CiAgICAgICAgfQoKICAgICAgICBpZiAoc3VtIDw9IGspIHsKICAgICAgICAgICAgbWF4TGVuID0gbWF4KG1heExlbiwgaiAtIGkgKyAxKTsKICAgICAgICB9CiAgICB9CgogICAgY291dCA8PCBtYXhMZW4gPDwgIlxuIjsKICAgIHJldHVybiAwOwp9

NQoxIDIgMyA0IDUKMTA=

5
1 2 3 4 5
10