#include <bits/stdc++.h>
using namespace std;
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
typedef long long int ll;
#define all(a) a.begin(),a.end()
const int MAXN = 2e5+5;
int a[MAXN],b[MAXN];
int t[4*MAXN];
void upd(int v,int l,int r,int pos,int val){
if(l==r){
t[v] = max(t[v],val);
return;
}
int tm = (l+r)/2;
if(pos<=tm)upd(2*v,l,tm,pos,val);
else upd(2*v+1,tm+1,r,pos,val);
t[v] = max(t[2*v],t[2*v+1]);
}
int query(int v,int l,int r,int tl,int tr){
if(l>r)return 0;
if(l==tl && r==tr)return t[v];
int tm = (tl+tr)/2;
return max(query(2*v,l,min(r,tm),tl,tm),
query(2*v+1,max(l,tm+1),r,tm+1,tr));
}
int dp[MAXN];
int main()
{
owo
int n,x;
cin>>n>>x;
vector<int>c = {0};
for(int i=0;i<n;i++){
cin>>a[i];
b[i] = a[i];
c.push_back(a[i]);
}
sort(all(c));
c.resize(unique(all(c)) - c.begin());
for(int i=0;i<n;i++)a[i] = lower_bound(all(c),a[i]) - c.begin()+1;
int rn = c.size();
//cout<<rn<<'\n';
for(int i=n-1;i>=0;i--){
dp[i] = query(1,a[i]+1,rn,1,rn) + 1;
upd(1,1,rn,a[i],dp[i]);
}
//for(int i=0;i<n;i++)cout<<dp[i]<<" ";
//cout<<'\n';
for(int i=0;i<=4*n+10;i++)t[i] = 0;
int ans = 1;
for(int i=0;i<n;i++){
int cur = 0;
int p = lower_bound(all(c),b[i]+x) - c.begin() + 1;
cur = query(1,1,p-1,1,rn);
ans = max(ans,cur+dp[i]);
cur = query(1,1,a[i]-1,1,rn)+1;
upd(1,1,rn,a[i],cur);
//cout<<i<<" "<<cur<<'\n';
}
cout<<ans<<'\n';
}
