#include <bits/stdc++.h>
#define int int64_t
using namespace std;
const int maxv = 2e9 + 10;
const int maxn = 2e5 + 10;
const int inf = 0x3f3f3f3f3f3f3f3fll;
int n, x;
int dp[maxn], dp2[maxn], v[maxn];
struct node{
int v;
node *l, *r;
node(int v=-inf): v(v), l(0), r(0) {}
};
void update(node* no, int p, int v, int ini=-maxv, int fim=maxv){
if(ini == fim){
no->v = v;
return;
}
int meio = (ini+fim)>>1;
if(p <= meio){
if(!no->l) no->l = new node;
update(no->l, p, v, ini, meio);
}else{
if(!no->r) no->r = new node;
update(no->r, p, v, meio+1, fim);
}
no->v = (no->l?no->l->v:-inf), (no->r?no->r->v:-inf);
}
int query(node* no, int l, int r, int ini=-maxv, int fim=maxv){
if(!no || ini > r || fim < l) return -inf;
else if(l <= ini && fim <= r) return no->v;
int meio = (ini+fim)>>1;
int p1 = (no->l?query(no->l, l, r, ini, meio):-inf);
int p2 = (no->r?query(no->r, l, r, meio+1, fim):-inf);
return max(p1, p2);
}
int32_t main() {
cin >> n >> x;
for(int i=1;i<=n;i++)
cin >> v[i];
dp[1] = 1, dp2[1] = 1;
node *n1 = new node, *n2 = new node;
for(int i=2;i<=n;i++){
dp[i] = dp2[i] = 1;
// dp[i] = 1 + query(n1, -maxv, v[i]-1);
// dp2[i] = 1 + max(query(n1, -maxv, v[i]-x-1), query(n2, -maxv, v[i]));
for(int j=1;j<i;j++){
if(v[j] - x >= v[i]) continue;
dp2[i] = max(dp2[i], 1 + dp[j]);
if(v[j] >= v[i]) continue;
dp[i] = max(dp[i], 1 + dp[j]);
dp2[i] = max(dp2[i], 1 + dp2[j]);
}
}
int ans=0;
for(int i=1;i<=n;i++)
ans = max(ans, dp2[i]);
cout << ans << "\n";
return 0;
}
