// TC : O(N^2)
// 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;
 
	for(int i=0; i<n; i++) { // O(N)
		int sum = 0;
		for(int j=i; j<n; j++) { // O(N)
			sum += arr[j];
			if(sum <= k) {
				int currentLength = abs(j - i + 1);
				maxLength = max(maxLength, currentLength);
			}
		}
	}
	cout << "Maximum Length: "<<maxLength;
	return 0;
}

Ly8gVEMgOiBPKE5eMikKLy8gU0MgOiBPKE4pCgojaW5jbHVkZSA8aW9zdHJlYW0+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCWludCBuOwoJY2luID4+IG47CgkKCWludCBhcnJbbisxXSA9IHswfTsKCQoJZm9yKGludCBpPTA7IGk8bjsgaSsrKSB7CgkJY2luID4+IGFycltpXTsKCX0KCQoJaW50IGs7CgljaW4gPj4gazsKCQoJaW50IG1heExlbmd0aCA9IDA7CgkKCWZvcihpbnQgaT0wOyBpPG47IGkrKykgeyAvLyBPKE4pCgkJaW50IHN1bSA9IDA7CgkJZm9yKGludCBqPWk7IGo8bjsgaisrKSB7IC8vIE8oTikKCQkJc3VtICs9IGFycltqXTsKCQkJaWYoc3VtIDw9IGspIHsKCQkJCWludCBjdXJyZW50TGVuZ3RoID0gYWJzKGogLSBpICsgMSk7CgkJCQltYXhMZW5ndGggPSBtYXgobWF4TGVuZ3RoLCBjdXJyZW50TGVuZ3RoKTsKCQkJfQoJCX0KCX0KCWNvdXQgPDwgIk1heGltdW0gTGVuZ3RoOiAiPDxtYXhMZW5ndGg7CglyZXR1cm4gMDsKfQ==

NQoxCjIKMwo0CjUKMTA=

5
1
2
3
4
5
10