#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
int n;
cin >> n;
vector<ll> A(n);
for (int i = 0; i < n; i++) {
cin >> A[i];
}
ll target;
cin >> target;
ll count =0;
unordered_map<ll, ll> mpp;
for(int j=0;j<n ;j++){
int r1= A[j]+target;
int r2= A[j]- target;
if(target==0)
count+=mpp[r1];
else{
count+= mpp[r1];
count+= mpp[r2];
}
mpp[A[j]]++;
}
cout<<count<<endl;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiAKdHlwZWRlZiBsb25nIGxvbmcgaW50IGxsOwogCmludCBtYWluKCkgewogICAgaW50IG47CiAgICBjaW4gPj4gbjsKIAogICAgdmVjdG9yPGxsPiBBKG4pOwogICAgZm9yIChpbnQgaSA9IDA7IGkgPCBuOyBpKyspIHsKICAgICAgICBjaW4gPj4gQVtpXTsKICAgIH0KIAogICAgbGwgdGFyZ2V0OwogICAgY2luID4+IHRhcmdldDsKIAogICAKICAgbGwgY291bnQgPTA7CiAgIAogICB1bm9yZGVyZWRfbWFwPGxsLCBsbD4gbXBwOwogICAKICAgZm9yKGludCBqPTA7ajxuIDtqKyspewogICAJaW50IHIxPSBBW2pdK3RhcmdldDsKICAgCWludCByMj0gQVtqXS0gdGFyZ2V0OwogICAJCiAgIAlpZih0YXJnZXQ9PTApCiAgIAljb3VudCs9bXBwW3IxXTsKICAgCQogICAJZWxzZXsKICAgCQljb3VudCs9IG1wcFtyMV07CiAgIAkJY291bnQrPSBtcHBbcjJdOwogICAJfQogICAJCiAgIAltcHBbQVtqXV0rKzsKICAgCQogICB9CiAgIGNvdXQ8PGNvdW50PDxlbmRsOwogCiAgICByZXR1cm4gMDsKfQ==