#include <bits/stdc++.h>
using namespace std;
int getCount(int n,int k,vector<int>arr){
int i=0;
int count=0;
for(int j=0;j<n;j++){
int diff=arr[j]-arr[i];
while(diff>k){
i++;
diff=arr[j]-arr[i];
}
count=count+(j-i+1);
}
return (count-n);
}
int main() {
// your code goes here
int n;
cin>>n;
vector<int>arr(n,0);
for(int i=0;i<n;i++){
cin>>arr[i];
}
int k;
cin>>k;
sort(arr.begin(),arr.end()); //need to sort for j>i
cout<<"Count of pairs with difference<=k:"<<getCount(n,k,arr);
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmludCBnZXRDb3VudChpbnQgbixpbnQgayx2ZWN0b3I8aW50PmFycil7CglpbnQgaT0wOwoJaW50IGNvdW50PTA7Cglmb3IoaW50IGo9MDtqPG47aisrKXsKCQlpbnQgZGlmZj1hcnJbal0tYXJyW2ldOwoJCXdoaWxlKGRpZmY+ayl7CgkJCWkrKzsKCQkJZGlmZj1hcnJbal0tYXJyW2ldOwoJCX0KCQljb3VudD1jb3VudCsoai1pKzEpOwoJfQoJcmV0dXJuIChjb3VudC1uKTsKIAp9CiAKaW50IG1haW4oKSB7CgkvLyB5b3VyIGNvZGUgZ29lcyBoZXJlCglpbnQgbjsKCWNpbj4+bjsKCXZlY3RvcjxpbnQ+YXJyKG4sMCk7Cglmb3IoaW50IGk9MDtpPG47aSsrKXsKCQljaW4+PmFycltpXTsKCX0KCWludCBrOwoJY2luPj5rOwoJc29ydChhcnIuYmVnaW4oKSxhcnIuZW5kKCkpOyAvL25lZWQgdG8gc29ydCBmb3Igaj5pCiAKCWNvdXQ8PCJDb3VudCBvZiBwYWlycyB3aXRoIGRpZmZlcmVuY2U8PWs6Ijw8Z2V0Q291bnQobixrLGFycik7CglyZXR1cm4gMDsKfQ==