#include<iostream>
#include<algorithm>
using namespace std;
const int MAXN=5e4+5;
int n,k,a[MAXN],b[MAXN],ans1,ans,ll,rr;
int main(){
	cin>>n>>k;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	sort(a+1,a+1+n,greater<int>());
	int l=1,r=1;
	a[n+1]=2e9;
	while(l<=r&&r<=n+1){
		while(a[l]-a[r]<=k&&r<=n+1){
			r++;
		}
		b[r]=max(b[r],r-l);
		ans1=max(ans1,b[l]);
		ans=max(ans,ans1+r-l);
		l++;
	}
	cout<<ans<<endl;
	return 0;
}