#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define F first
#define S second
#define FOR(i,a,b) for (auto i = (a); i <= (b); ++i)
#define NFOR(i,a,b) for(auto i = (a); i >= (b); --i)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define mp(i,a) make_pair(i,a)
#define pb(a) push_back(a)
#define bit(x,b) (x&(1LL<<b))
typedef long long int lli;
typedef pair <lli,lli> ii;
typedef pair <lli,ii> iii;
typedef vector <lli> vi;
typedef tree<ii,null_type,less<ii>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ordered_set se;
lli n,k,co=0,cs=1,ans=0;
cin>>n;
lli arr[n];
for(lli i=0;i<n;++i)
cin>>arr[i];
cin>>k;
for(lli i=0;i<n;++i)
{
arr[i]-=k;
cs+=arr[i];
se.insert(mp(arr[i]-cs,co));
ans+=se.size()-se.order_of_key(mp(-cs,0*1LL));
co++;
}
cout<<ans<<endl;
return(0);
}
