#include <bits/stdc++.h>
using namespace std;
int getCount(int n,vector<int>v,int k){
	int count=0;
	int sum=0;
	int i=0;
	for(int j=0;j<n;j++){
		sum+=v[j];
		while(sum>k){
			sum=sum-v[i];
			i++;
		}
		count=count+j-i+1;
	}
	return count;
}
 
int main() {
	// your code goes here
	int n;
	cin>>n;
	vector<int>v(n,0);
	for(int i=0;i<n;i++){
		cin>>v[i];
	}
	int k;
	cin>>k;
	cout<<"The number of subarray with sum less than k is:"<<getCount(n,v,k);
	return 0;
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmludCBnZXRDb3VudChpbnQgbix2ZWN0b3I8aW50PnYsaW50IGspewoJaW50IGNvdW50PTA7CglpbnQgc3VtPTA7CglpbnQgaT0wOwoJZm9yKGludCBqPTA7ajxuO2orKyl7CgkJc3VtKz12W2pdOwoJCXdoaWxlKHN1bT5rKXsKCQkJc3VtPXN1bS12W2ldOwoJCQlpKys7CgkJfQoJCWNvdW50PWNvdW50K2otaSsxOwoJfQoJcmV0dXJuIGNvdW50Owp9CiAKaW50IG1haW4oKSB7CgkvLyB5b3VyIGNvZGUgZ29lcyBoZXJlCglpbnQgbjsKCWNpbj4+bjsKCXZlY3RvcjxpbnQ+dihuLDApOwoJZm9yKGludCBpPTA7aTxuO2krKyl7CgkJY2luPj52W2ldOwoJfQoJaW50IGs7CgljaW4+Pms7Cgljb3V0PDwiVGhlIG51bWJlciBvZiBzdWJhcnJheSB3aXRoIHN1bSBsZXNzIHRoYW4gayBpczoiPDxnZXRDb3VudChuLHYsayk7CglyZXR1cm4gMDsKfQ==

NQoyIDEgMSA1IDgKNA==

5
2 1 1 5 8
4