#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 2e5;
int n, x, arr[N + 5];
struct node {
int v = 0;
node *lef = nullptr, *rig = nullptr;
void extend() {
if (!lef) lef = new node(), rig = new node();
}
void update(int tl, int tr, int k, int x) {
if (tl == tr) v = max(v, x);
else {
extend();
int tm = tl + (tr - tl)/2;
if (k <= tm) lef->update(tl, tm, k, x);
else rig->update(tm + 1, tr, k, x);
v = max(lef->v, rig->v);
}
}
int query(int tl, int tr, int l, int r) {
if (l > r) return 0;
else if (tl == l && tr == r) return v;
else {
extend();
int tm = tl + (tr - tl)/2;
return max(lef->query(tl, tm, l, min(tm, r)), rig->query(tm + 1, tr, max(l, tm + 1), r));
}
}
} *root0 = new node(), *root1 = new node();
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> x;
for (int i = 1; i <= n; i++) cin >> arr[i];
int ans = 0;
for (int i = 1; i <= n; i++) {
int res0 = root0->query(-1e9, 2e9, -1e9, arr[i] - 1) + 1;
int res1 = max(root1->query(-1e9, 2e9, -1e9, arr[i] - 1) + 1, root0->query(-1e9, 2e9, -1e9, arr[i] + x - 1) + 1);
root0->update(-1e9, 2e9, arr[i], res0);
root1->update(-1e9, 2e9, arr[i], res1);
ans = max({ans, res0, res1});
}
cout << ans << '\n';
return 0;
}
