#include <bits/stdc++.h>
#define ll long long
#define en "\n"
#define pb push_back
#define mp make_pair
#define pii pair<ll,ll>
#define fi first
#define se second
#define rep(i, a, b) for(ll i = a; i <= b; ++i)
#define per(i, a, b) for(ll i = a; i >= b; --i)
#define kaizokuO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define r0 return 0
#define all(v) v.begin(), v.end()
#define MAX(v) *max_element(all(v))
#define MIN(v) *min_element(all(v))
#define gcd(a,b) __gcd(a,b);
#define lcm(a,b) (a*b)/ __gcd(a, b)
#define bitt(x) __builtin_popcount(x)
#define fill1(arr, i, n) for(ll a = 0; a <= n; ++a) arr[a] = i;
#define fill2(arr, i, n, m) for(ll a = 0; a <= n; ++a) for(ll b = 0; b <= m; ++b) arr[a][b] = i;
#define flsh fflush(stdout)
#define ext exit(0)
#define inp freopen("input.txt","r",stdin)
#define outp freopen("output.txt","w",stdout)
using namespace std;
//const ll mod = 1e9 + 7;
const ll mod = 998244353;
//const ll mod = 26101991;
//const ll mod = 1e8;
//const ll mod = 1e9+9;
//const double pi = 3.14159265;
ll st[3000003];
void upd(ll node, ll l, ll r, ll idx){
if(l == r) st[node]+=1;
else{
ll mid = (l+r)/2;
if(idx <= mid) upd(2*node, l, mid, idx);
else upd(2*node+1, mid+1, r, idx);
st[node] = st[node*2] + st[node*2+1];
}
}
ll query(ll node, ll l, ll r, ll lq, ll rq){
if(lq > r || rq < l) return 0;
if(l>=lq && r<=rq) return st[node];
ll mid = (l+r)/2;
return query(2*node, l, mid, lq, rq) + query(2*node+1, mid+1, r, lq, rq);
}
void solve(){
ll n; cin >> n;
ll arr[n+3]; for(ll i = 1; i <= n; ++i) cin >> arr[i];
ll k; cin >> k;
arr[0] = 0;
for(ll i = 1; i <= n; ++i){
arr[i] += arr[i-1];
}
vector<ll> v;
for(ll i = 1; i <= n; ++i){
arr[i] -= k*i;
v.pb(arr[i]);
}
sort(all(v));
v.erase(unique(all(v)), v.end());
upd(1, 1, n, lower_bound(all(v), 0)- v.begin()+1);
ll ans=0;
for(ll i = 1; i <= n; ++i){
ans += query(1, 1, n, 1, lower_bound(all(v), arr[i])- v.begin()+1);
upd(1, 1, n, lower_bound(all(v), arr[i])- v.begin()+1);
}
cout << ans << en;
}
int main() {
kaizokuO;
ll t = 1; //cin >> t;
while(t--){
solve();
}
}
