#include <bits/stdc++.h>
using namespace std;
int getLargest(vector<int>& arr,int k){
	int sum=0;
	int n=arr.size();
	int largest=-10000;
	for(int i=0,j=0;j<n;j++){
		sum+=arr[j];
		if(sum>k){
			i++;
			sum=sum-arr[i];
		}
		int len=j-i+1;
		largest=max(largest,len);
	}
	return largest;
}
 
int main() {
	// your code goes here
	int n;
	cin>>n;
	vector<int>arr(n);
	for(int i=0;i<n;i++){
		cin>>arr[i];
	}
	int k;
	cin>>k;
	int maxi=getLargest(arr,k);
	cout<<"The largest subarray with sum<=k is:"<<maxi;
	return 0;
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmludCBnZXRMYXJnZXN0KHZlY3RvcjxpbnQ+JiBhcnIsaW50IGspewoJaW50IHN1bT0wOwoJaW50IG49YXJyLnNpemUoKTsKCWludCBsYXJnZXN0PS0xMDAwMDsKCWZvcihpbnQgaT0wLGo9MDtqPG47aisrKXsKCQlzdW0rPWFycltqXTsKCQlpZihzdW0+ayl7CgkJCWkrKzsKCQkJc3VtPXN1bS1hcnJbaV07CgkJfQoJCWludCBsZW49ai1pKzE7CgkJbGFyZ2VzdD1tYXgobGFyZ2VzdCxsZW4pOwoJfQoJcmV0dXJuIGxhcmdlc3Q7Cn0KIAppbnQgbWFpbigpIHsKCS8vIHlvdXIgY29kZSBnb2VzIGhlcmUKCWludCBuOwoJY2luPj5uOwoJdmVjdG9yPGludD5hcnIobik7Cglmb3IoaW50IGk9MDtpPG47aSsrKXsKCQljaW4+PmFycltpXTsKCX0KCWludCBrOwoJY2luPj5rOwoJaW50IG1heGk9Z2V0TGFyZ2VzdChhcnIsayk7Cgljb3V0PDwiVGhlIGxhcmdlc3Qgc3ViYXJyYXkgd2l0aCBzdW08PWsgaXM6Ijw8bWF4aTsKCXJldHVybiAwOwp9

NwoxIDIgMSAwIDEgMSAwCjQ=

7
1 2 1 0 1 1 0
4