#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
#pragma GCC optimize("Ofast")
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define pb push_back
#define popf pop_front
#define popb pop_back
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
template <class T> void print(set <T> v);
template <class T> void print(vector <T> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T, class V> void print(pair <T, V> p);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(unordered_map<T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
// for grid problems
long long dx[8] = {-1,0,1,0,1,-1,1,-1};
long long dy[8] = {0,1,0,-1,1,1,-1,-1};
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
fastIO();
if (str != "" && str != "input") {
freopen((str + ".in").c_str(), "r", stdin);
freopen((str + ".out").c_str(), "w", stdout);
}
if(str == "input") {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
}
// Random
mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const long long inf = 1e9;
long long n, x;
struct segTree {
vector<long long> tree;
int size = 1;
void init(int s) {
while(size < s) {
size *= 2;
}
tree.assign(2 * size - 1, 0);
}
void upd(int u, long long value, int x, int lx, int rx) {
if(rx - lx == 1) {
tree[x] = max(tree[x], value);
return;
}
int mid = (lx + rx) / 2;
if(u < mid) {
upd(u, value, 2 * x + 1, lx, mid);
} else {
upd(u, value, 2 * x + 2, mid, rx);
}
tree[x] = max(tree[2 * x + 1], tree[2 * x + 2]);
}
void upd(int u, long long value) {
upd(u, value, 0, 0, size);
}
long long qry(int l, int r, int x, int lx, int rx) {
if(lx >= r || rx <= l) {
return 0;
}
if(lx >= l && rx <= r) {
return tree[x];
}
int mid = (lx + rx) / 2;
long long s1 = qry(l, r, 2 * x + 1, lx, mid);
long long s2 = qry(l, r, 2 * x + 2, mid, rx);
return max(s1, s2);
}
long long qry(int l, int r) {
return qry(l, r, 0, 0, size);
}
};
segTree seg;
void solve_() {
cin >> n >> x;
vector<long long> a(n);
vector<long long> val;
for(int i = 0; i < n; i++) {
cin >> a[i];
val.push_back(a[i]);
val.push_back(a[i] + x);
}
sort(all(val));
uniq(val);
seg.init(sz(val));
vector<long long> dpRight(n, 1), dpLeft(n, 1);
for(int i = n - 1; i >= 0; i--) {
int id = lower_bound(all(val), a[i]) - val.begin();
dpRight[i] = 1 + seg.qry(id + 1, sz(val) + 1);
seg.upd(id, dpRight[i]);
}
seg.init(sz(val));
long long answ = *max_element(all(dpRight));
for(int i = 0; i < n; i++) {
int id = lower_bound(all(val), a[i]) - val.begin();
dpLeft[i] = 1 + seg.qry(0, id);
if(i) {
int idi = lower_bound(all(val), a[i] + x) - val.begin();
answ = max(answ, dpRight[i] + seg.qry(id, idi));
}
seg.upd(id, dpLeft[i]);
}
printf("%lld\n", answ);
}
int main() {
setIO();
auto solve = [&](int test_case)-> void {
while(test_case--) {
solve_();
}
};
int test_cases = 1;
solve(test_cases);
return 0;
}
