/*-----------------------------
Author : TgX.2
11Ti - K28 - CHV
-----------------------------*/
#include <bits/stdc++.h>
using namespace std;
#ifdef TGX
#include "debug.h"
#else
#define debug(...)
#endif
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; i += 1)
#define FORD(i, a, b) for (int i = (a), _b = (b); i >= _b; i -= 1)
#define fi first
#define se second
#define pb push_back
#define len(x) (int)((x).size())
#define all(x) (x).begin(), (x).end()
#define _ << " " <<
#define __ << "\n"
#define ___ << " "
#define ______________TgX______________ main()
#define int long long
#define intmax 1e9
#define intmin -1e9
#define llongmax 1e18
#define llongmin -1e18
#define memo(a, val) memset((a), (val), sizeof((a)))
struct custom {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
template<class T1, class T2> using cmap = unordered_map<T1, T2, custom>;
template<typename T1, typename T2>
bool mini(T1 &a, T2 b)
{if (a > b) a = b; else return 0; return 1;}
template<typename T1, typename T2>
bool maxi(T1 &a, T2 b)
{if (a < b) a = b; else return 0; return 1;}
/*-----------------------------*/
const int maxn = 1e6 + 7;
int n, x, a[maxn];
class FenwickTree {
private:
int n;
vector<int> bit;
int query(int pos) {
int ans = 0;
for(; pos >= 1; pos -= (pos & -pos)) ans += bit[pos];
return ans;
}
void change(int pos, int val) {
for(; pos <= n; pos += (pos & -pos)) bit[pos] += val;
}
public:
FenwickTree(int _n) {
n = _n;
bit.assign(n + 7, 0);
}
void update(int pos, int val) { change(pos, val); }
void update(int l, int r, int val) {
change(l, val);
change(r + 1, -val);
}
int get(int l) { return query(l); }
int get(int l, int r) { return query(r) - query(l - 1); }
};
void process() {
cin >> n;
a[0] = 0;
FOR(i, 1, n) cin >> a[i];
cin >> x;
FOR(i, 1, n) a[i] -= x;
vector<int> val;
FOR(i, 1, n) {
a[i] += a[i - 1];
val.pb(a[i]);
}
val.pb(0);
sort(all(val));
val.erase(unique(all(val)), val.end());
FOR(i, 0, n)
a[i] = lower_bound(all(val), a[i]) - val.begin() + 1;
FenwickTree ft(1000000);
ft.update(a[0], 1);
// debug(a[0]);
int ans = 0;
FOR(i, 1, n) {
// cout << ft.get(a[i]) __ ;
ans += ft.get(a[i]);
// debug(a[i]);
ft.update(a[i], 1);
}
cout << ans;
}
/*-----------------------------*/
______________TgX______________ {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
if (fopen("temp.inp", "r")) {
freopen("temp.inp", "r", stdin);
freopen("temp.out", "w", stdout);
}
process();
cerr << "Time: " << 1.0 * clock() / CLOCKS_PER_SEC << " s." __ ;
}
/*==============================+
|INPUT |
--------------------------------|
================================+
|OUTPUT |
--------------------------------|
===============================*/
