// TC : O(N)
// SC : O(N)
 
#include <iostream>
using namespace std;
 
int main() {
	int n;
	cin >> n;
 
	int arr[n+1] = {0};
 
	for(int i=0; i<n; i++) {
		cin >> arr[i];
	}
 
	int k;
	cin >> k;
 
	int maxLength = 0;
	int sum = 0;
 
	for(int i=0, j=0; j<n; j++) {
		sum = sum + arr[j];
		while(sum > k) {
			sum -= arr[i];
			i++;
		}
		int length = (j - i + 1);
 
		maxLength = max(maxLength, length); // sum[i.....j] <= k
	}
	cout << "Maximum Length: "<<maxLength;
	return 0;
}

Ly8gVEMgOiBPKE4pCi8vIFNDIDogTyhOKQoKI2luY2x1ZGUgPGlvc3RyZWFtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKSB7CglpbnQgbjsKCWNpbiA+PiBuOwoJCglpbnQgYXJyW24rMV0gPSB7MH07CgkKCWZvcihpbnQgaT0wOyBpPG47IGkrKykgewoJCWNpbiA+PiBhcnJbaV07Cgl9CgkKCWludCBrOwoJY2luID4+IGs7CgkKCWludCBtYXhMZW5ndGggPSAwOwoJaW50IHN1bSA9IDA7CgkKCWZvcihpbnQgaT0wLCBqPTA7IGo8bjsgaisrKSB7CgkJc3VtID0gc3VtICsgYXJyW2pdOwoJCXdoaWxlKHN1bSA+IGspIHsKCQkJc3VtIC09IGFycltpXTsKCQkJaSsrOwoJCX0KCQlpbnQgbGVuZ3RoID0gKGogLSBpICsgMSk7CgkJCgkJbWF4TGVuZ3RoID0gbWF4KG1heExlbmd0aCwgbGVuZ3RoKTsgLy8gc3VtW2kuLi4uLmpdIDw9IGsKCX0KCWNvdXQgPDwgIk1heGltdW0gTGVuZ3RoOiAiPDxtYXhMZW5ndGg7CglyZXR1cm4gMDsKfQ==

NQoxCjIKMwo0CjUKMTA=

5
1
2
3
4
5
10