#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<long long,null_type,less<long long>,rb_tree_tag,tree_order_statistics_node_update>ordered_set;
ordered_set s;
int x,k,a[1000005];
int main(){
ios::sync_with_stdio(0);cin.tie(0);
cin>>x;
long long ans=0;
for(int i=0;i<x;i++)cin>>a[i];
cin>>k;
s.insert(0);
long long xd=0;
for(int i=0;i<x;i++){
xd+=a[i]-k;
ans+=s.order_of_key(xd+1);
s.insert(xd);
}
cout<<ans;
return 0;
}
