#include <cmath>
#include <string>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int N=2e6+1;
int half(int key,int l,int r,int a[]){
	while(l<=r){
		int mid=l+(r-l)/2;
		if(a[mid]==key){
			return 1;
		}
		if(a[mid]<key){
			l=mid+1;
		}
		if(a[mid]>key){
			r=mid-1;
		}
	}
	return 0;
}
int a[N],n,c,cnt=0;
int main() {
	cin>>n>>c;
	int l=1,r=n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	} 
	sort(a+1,a+n+1);
	for(int i=1;i<=n;i++){
		if(half(a[i]-c,l,r,a)){
			cnt++;
		}
	}
	cout<<cnt;
	return 0;
}