#include<iostream>
#include<algorithm>
using namespace std;
int n,k,b,gs=0;
int a[100005];
int binary_search(int l,int r){
	while(l+1<r&&a[l]<b){
		int mid=(l+r)>>1;
		if(a[mid]<=b){
			l=mid;
		}
		else r=mid;
	}
	return a[l];
}
int main(){
	cin>>n;
	cin>>k;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	sort(a+1,a+n+1);
	for(int i=1;i<=n;i++){
		b=a[i]-k;
		int x=binary_search(i-1,n+1);
		if(x==b){
            gs++;
		}
	}
    cout<<gs<<endl;
	return 0;
}