#include <iostream>
#include <bits/stdc++.h>
using namespace std;
 
int longest_subarray(vector<int>&arr,int k){
	int n=arr.size();
	int sum=0;
	int len=0;
	for(int i=0,j=0;j<n;j++){
		sum+=arr[j];
		while(sum>k){
			sum-=arr[i];
			i++;
		}
		len=max(len,j-i+1);
	}
	return len;
}
int main(){
	int n;
	cin>>n;
	vector<int>arr(n);
	for(int i=0;i<n;i++){
		cin>>arr[i];
	}
	int k;
	cin>>k;
 
	int length=longest_subarray(arr,k);
	cout<<"Longest subarray with length <="<<k<<": "<<length<<endl;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBsb25nZXN0X3N1YmFycmF5KHZlY3RvcjxpbnQ+JmFycixpbnQgayl7CglpbnQgbj1hcnIuc2l6ZSgpOwoJaW50IHN1bT0wOwoJaW50IGxlbj0wOwoJZm9yKGludCBpPTAsaj0wO2o8bjtqKyspewoJCXN1bSs9YXJyW2pdOwoJCXdoaWxlKHN1bT5rKXsKCQkJc3VtLT1hcnJbaV07CgkJCWkrKzsKCQl9CgkJbGVuPW1heChsZW4sai1pKzEpOwoJfQoJcmV0dXJuIGxlbjsKfQppbnQgbWFpbigpewoJaW50IG47CgljaW4+Pm47Cgl2ZWN0b3I8aW50PmFycihuKTsKCWZvcihpbnQgaT0wO2k8bjtpKyspewoJCWNpbj4+YXJyW2ldOwoJfQoJaW50IGs7CgljaW4+Pms7CgkKCWludCBsZW5ndGg9bG9uZ2VzdF9zdWJhcnJheShhcnIsayk7Cgljb3V0PDwiTG9uZ2VzdCBzdWJhcnJheSB3aXRoIGxlbmd0aCA8PSI8PGs8PCI6ICI8PGxlbmd0aDw8ZW5kbDsKfQ==

NQoxIDIgMyA0IDUgCjEw

5
1 2 3 4 5 
10