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