#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define AC "test"
#define foru(i, l, r) for (int i = (l); i <= (r); i++)
#define ford(i, l, r) for (int i = (l); i >= (r); i--)
#define fi first
#define se second
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vii;
typedef vector<ll> vll;
const ll inf = 1e9 + 7;
const ll linf = 1e18 + 7;
const int mod = 1e9 + 7;
const int maxn = 1e6 + 7;
const int base = 31;
void fastIO(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
}
ll mul(ll a, ll b){
a%=mod;
ll res = 0;
while (b){
if (b%2) res = (res + a)%mod;
a = (a + a)%mod;
b/=2;
}
return res;
}
ll Pow(ll a, ll b){
ll ans = 1;
while (b){
if (b % 2) ans = mul(ans, a);
a = mul(a, a);
b/=2;
}
return ans;
}
ll res, n, a[maxn], pre[maxn], bit[maxn], p;
vll b;
void update(int i){
for (; i < maxn; i+= i & (-i)){
bit[i]++;
}
}
ll get(int i){
ll ans = 0;
for (; i > 0; i-= i & (-i)){
ans += bit[i];
}
return ans;
}
void solve(){
cin >> n;
memset(bit, 0, sizeof(bit));
foru(i, 1, n){
cin >> a[i];
}
cin >> p;
foru(i, 1, n){
a[i] -= p;
pre[i] = pre[i - 1] + a[i];
b.pb(pre[i]);
}
b.pb(0);
sort(b.begin(), b.end());
b.erase(unique(b.begin(), b.end()), b.end());
foru(i, 0, n){
pre[i] = lower_bound(b.begin(), b.end(), pre[i]) - b.begin() + 1;
res += get(pre[i]);
update(pre[i]);
}
cout << res;
}
int main(){
fastIO();
if (fopen(AC".inp", "r")){
freopen(AC".inp", "r", stdin);
freopen(AC".out", "w", stdout);
}
solve();
}
