#include <bits/stdc++.h>
using namespace std;
#define sz(x) ((int)size(x))
#define all(x) begin(x), end(x)
#define trace(x) cout << #x << ": " << (x) << endl;
typedef long long ll;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r) { return (int) ((ll) rnd() % (r - l + 1)) + l; }
const int N = 200001;
const ll infL = 3e18;
int fn[N], n, a[N], yy[N], aa[N], lis[N], lds[N];
void setmax(int i, int x) {
for (; i < n; i |= i + 1)
fn[i] = max(fn[i], x);
}
int get(int i) {
int ans = 0;
for (; i > -1; i = ((i + 1) & i) - 1)
ans = max(ans, fn[i]);
return ans;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int d;
cin >> n >> d;
for (int i = 0; i < n; ++i)
cin >> a[i];
memcpy(yy, a, sizeof(yy[0]) * n);
memcpy(aa, a, sizeof(aa[0]) * n);
sort(yy, yy + n);
int m = unique(yy, yy + n) - yy;
for (int i = 0; i < n; ++i)
a[i] = lower_bound(yy, yy + m, a[i]) - yy;
int ans = 0;
for (int i = n - 1; i > -1; --i) {
lds[i] = get(n - (a[i] + 1) - 1) + 1;
ans = max(ans, lds[i]);
setmax(n - a[i] - 1, lds[i]);
}
memset(fn, 0, sizeof(fn));
for (int i = 0; i < n; ++i) {
int id = lower_bound(yy, yy + m, aa[i] + d) - yy;
ans = max(ans, get(id - 1) + lds[i]);
lis[i] = get(a[i] - 1) + 1;
setmax(a[i], lis[i]);
}
cout << ans;
return 0;
}
