#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
// #pragma GCC optimize("Ofast,unroll-loops,fast-math")
// #pragma GCC target("popcnt")
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define pb push_back
const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const ll MOD = 998244353; // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const int N = ll(4e5)+5;
const int M = ll(1e4) + 5;
const long long inf = 1e18;
const long double eps = 1e-15L;
ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; }
ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;}
void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
int n, x, a[N], b[N], c[N];
struct segtree {
int t[N * 4];
void update(int v, int tl, int tr, int p, int x) {
if(tl == tr) {
t[v] = x;
return;
}
int tm = (tl + tr) / 2;
if(p <= tm) update(v + v, tl, tm, p, x);
else update(v + v + 1, tm + 1, tr, p, x);
t[v] = max(t[v + v], t[v + v + 1]);
}
int get(int v, int tl, int tr, int l, int r) {
if(tl > r || l > tr) return 0;
if(l <= tl && tr <= r) return t[v];
int tm = (tl + tr) / 2;
return max(get(v + v, tl, tm, l, r), get(v + v + 1, tm + 1, tr, l, r));
}
}dp1, dp2;
void Baizho() {
cin>>n>>x;
vector<int> comp;
for(int i = 1; i <= n; i ++) {
cin>>a[i];
b[i] = a[i] + x;
comp.pb(a[i]); comp.pb(b[i]);
}
sort(all(comp));
comp.erase(unique(all(comp)), comp.end());
// segtree dp1;
for(int i = 1; i <= n; i ++) {
a[i] = upper_bound(all(comp), a[i]) - comp.begin();
b[i] = upper_bound(all(comp), b[i]) - comp.begin();
int val = dp1.get(1, 1, 2 * n, 1, a[i] - 1) + 1;
c[i] = val;
dp1.update(1, 1, 2 * n, a[i], val);
}
int ans = dp1.t[1];
// segtree dp2;
for(int i = n - 1; i >= 1; i --) {
int val = dp2.get(1, 1, 2 * n, b[i + 1] + 1, 2 * n) + 1;
dp2.update(1, 1, 2 * n, b[i + 1], val);
ans = max(ans, c[i] + dp2.get(1, 1, 2 * n, a[i] + 1, 2 * n));
}
int val = dp2.get(1, 1, 2 * n, b[1] + 1, 2 * n) + 1;
dp2.update(1, 1, 2 * n, b[1], val);
cout<<max(ans, dp2.t[1])<<"\n";
}
signed main() {
// Freopen("nondec");
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
// precalc();
int ttt = 1;
// cin>>ttt;
for(int i=1; i<=ttt; i++) {Baizho(); }
}
