#include <bits/stdc++.h>
using namespace std;
int ans(vector<int> &v,int &k){
unordered_map<int,int>m;
int count=0;
for(int i=0;i<v.size();i++){
int c= k+v[i];
if(m[c]>0)count+=m[c];
m[v[i]]++;
}
return count;
}
int main() {
// your code goes here
int n;cin>>n;
vector<int>v(n);
for(int i=0;i<n;i++)cin>>v[i];
int k;cin>>k;
cout<<ans(v,k)<<endl;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgYW5zKHZlY3RvcjxpbnQ+ICZ2LGludCAmayl7Cgl1bm9yZGVyZWRfbWFwPGludCxpbnQ+bTsKCWludCBjb3VudD0wOwoJZm9yKGludCBpPTA7aTx2LnNpemUoKTtpKyspewoJCWludCBjPSBrK3ZbaV07CgkJaWYobVtjXT4wKWNvdW50Kz1tW2NdOwoJCQoJCW1bdltpXV0rKzsKCX0KCXJldHVybiBjb3VudDsKfQppbnQgbWFpbigpIHsKCS8vIHlvdXIgY29kZSBnb2VzIGhlcmUKCWludCBuO2Npbj4+bjsKCXZlY3RvcjxpbnQ+dihuKTsKCWZvcihpbnQgaT0wO2k8bjtpKyspY2luPj52W2ldOwoJaW50IGs7Y2luPj5rOwoJY291dDw8YW5zKHYsayk8PGVuZGw7CglyZXR1cm4gMDsKfQ==