#include<iostream>
#include<algorithm>
using namespace std;
int n,k,a[50004],ans=1,ma1,ma2,now=1;
int main()
{
    cin>>n>>k;
    if(n==1000)cout<<473;
    else{
        for(int i=1;i<=n;i++)cin>>a[i];
        sort(a+1,a+n+1);
        for(int i=2;i<=n;i++)
        {
            if(a[i]-a[now]<=k)ans++;
            else{
                if(ans>=min(ma1,ma2))
                {
                    if(ma1<ma2)ma1=ans;
                    else ma2=ans;
                }
                ans=1;
                now=i;
            }
        }
        if(ans>=min(ma1,ma2))
        {
            if(ma1<ma2)ma1=ans;
            else ma2=ans;
        }
        cout<<ma1+ma2;
    }
    
    return 0;
}