#include <bits/stdc++.h>
#include <unordered_map>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define endl '\n'
//#define long long long long
#define all(pr1) pr1.begin(),pr1.end()
#define alr(pr1) pr1.rbegin(),pr1.rend()
#define CEIL(pr1, pr2) (pr1 + pr2 - 1) / pr2
#define IOS std::ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define RT(s) return cout<<s,0
#define sz(s) (long long)(s.size())
const long long N = 3e5 + 9, M = 1e9 + 9, MOD = 1e9 + 7, OO = 0x3f3f3f3f, MAX = 2147483647, LOO = 0x3f3f3f3f3f3f3f3f;
int32_t main()
{
IOS;
long long n, m;
cin >> n;
vector<long long> a(n), c;
vector<pair<long long, long long>> b;
map<long long, int> mp;
for (long long i = 0; i < n; i++)
cin >> a[i];
cin >> m;
a[0] -= m;
for (long long i = 1; i < n; i++)
{
a[i] -= m;
a[i] += a[i - 1];
}
for (long long i = 0; i < n; i++)
mp[a[i]]++;
for (auto ch : mp)
b.push_back({ ch.first, ch.second });
cout << 0 << "\n";
}
