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