#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
using namespace std;
using namespace __gnu_pbds;
#define ordered_set tree<pair <int,int> , null_type,less<pair <int,int>>, rb_tree_tag,tree_order_statistics_node_update>
signed main(){
ios_base::sync_with_stdio();
cin.tie(0);cout.tie(0);
int n,p;
cin>>n;
vector <int> a(n);
for(int i=0;i<n;i++)cin>>a[i];
cin>>p;
ordered_set st;
int sum=0;
int ans=0;
for(int i=0;i<n;i++){
st.insert({sum-i*p,i});
sum+=a[i];
int x=sum-p*i-p;
ans+=st.order_of_key({x,1e9});
}
cout<<ans<<"\n";
}
/*
*/
