#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops")
#define bupol __builtin_popcount
#define int long long
#define ll long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
using namespace std;
const int MAXN = 3e5+20;
const int LOG = 60;
const int MOD = 998244353;
const int SQRT = 520;
const int INF = 1e18;
typedef pair<int,int> pii;
typedef pair<pii,int> ipii;
int n, x;
int a[MAXN], add[MAXN];
vector <int> vec;
struct seg {
int st[4*MAXN];
int que(int id, int l, int r, int x, int y){
if(x<=l && r<=y) return st[id];
if(r<x || y<l) return -INF;
return max(que(lf, l, md, x, y), que(rg, md+1, r, x, y));
}
int upd(int id, int l, int r, int x, int y){
if(l==r && r==x) return st[id] = max(st[id], y);
if(r<x || x<l) return st[id];
return st[id] = max(upd(lf, l, md, x, y), upd(rg, md+1, r, x, y));
}
} A, B;
signed main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin >> n >> x;
vector <int> cor;
for(int i=1; i<=n; i++){
cin >> a[i];
cor.pb(a[i]); cor.pb(a[i]+x);
}
//for(int i=0; i<=4*n; i++) st[i] = -INF;
cor.pb(-INF);
sort(cor.begin(), cor.end());
cor.resize(unique(cor.begin(), cor.end()) - cor.begin());
for(int i=1; i<=n; i++){
int te = a[i];
a[i] = lower_bound(cor.begin(), cor.end(), a[i]) - cor.begin();
add[i] = lower_bound(cor.begin(), cor.end(), te+x) - cor.begin();
//cout << i << ' ' << a[i] << ' ' << add[i] << " i\n";
}
int ans = 0;
for(int i=1; i<=n; i++){
int num = A.que(1, 1, 2*n, 1, a[i]-1);
int num2 = A.que(1, 1, 2*n, 1, add[i]-1);
int pre = B.que(1, 1, 2*n, 1, add[i]-1);
A.upd(1, 1, 2*n, a[i], max(0ll, num)+1);
B.upd(1, 1, 2*n, add[i], max(0ll, max(num2, pre))+1);
ans = max(ans, max(max(num2, pre), max(num, 0ll))+1 );
}
//for(int i=1; i<=n; i++) cout << pr[i] << " \n"[i==n];
cout << ans << '\n';
}
