// Cao Quang Hung
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<long long , long long>
#define vi vector<int>
#define vpii vector<pii>
#define SZ(x) ((int)(x.size()))
#define fi first
#define se second
#define IN(x,y) ((y).find((x))!=(y).end())
#define ALL(t) t.begin(),t.end()
#define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++)
#define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
#define REPD(i,a,b) for(int (i)=(a); (i)>=(b);--i)
#define FOR(i, n) for (int (i) = 0; (i) < (n); ++(i))
#define dem(x) __builtin_popcount(x)
#define Mask(x) (1LL << (x))
#define BIT(x, i) ((x) >> (i) & 1)
#define ln '\n'
#define io_faster ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
///mt19937 rnd(time(0));
const int INF = 1e9 , mod = 1e9 + 7;
template <class T1, class T2>
inline T1 mul(T1& x, const T2 &k){ return x = (1LL * x * k) % mod; }
template <class T1 , class T2>
inline T1 pw(T1 x, T2 k){T1 res = 1; for (; k ; k >>= 1){ if (k & 1) mul(res, x); mul(x, x); } return res;}
template <class T>
inline bool minimize(T &x, const T &y){ if (x > y){x = y; return 1;} return 0; }
template <class T>
inline bool maximize(T &x, const T &y){ if (x < y){x = y; return 1;} return 0; }
template <class T>
inline void add(T &x , const T &y){ if ((x += y) >= mod) x -= mod; }
template <class T>
inline T product (const T &x , const T &y) { return 1LL * x * y % mod; }
#define PROB "a"
void file(){
if(fopen(PROB".inp", "r")){
freopen(PROB".inp","r",stdin);
freopen(PROB".out","w",stdout);
}
}
void sinh_(){
// srand(time(0));
// freopen(PROB".inp" , "w" , stdout);
// int n;
}
typedef long long ll;
typedef double db;
const int N = 2e5 + 5;
int n, x, a[N][2], m;
int suff[N], pref[N];
vector<int> compress;
void readip(){
cin >> n >> x;
REP(i, 1, n) {
cin >> a[i][0];
compress.eb(a[i][0]);
compress.eb(a[i][0] + x);
}
sort(ALL(compress));
compress.erase(unique(ALL(compress)), compress.end());
REP(i, 1, n) {
a[i][1] = lower_bound(ALL(compress), a[i][0] + x) - compress.begin() + 1;
a[i][0] = lower_bound(ALL(compress), a[i][0]) - compress.begin() + 1;
}
m = compress.size();
}
struct segtree{
int it[N << 3] = {};
void upd(int u, int val, int id = 1, int l = 1, int r = m) {
if (l == r) {
maximize(it[id], val);
return;
}
int mid = (l + r) >> 1;
if (u <= mid) upd(u, val, id << 1, l, mid);
else upd(u, val, id << 1 | 1, mid + 1, r);
it[id] = max(it[id << 1], it[id << 1 | 1]);
}
int get(int u, int v, int id = 1, int l = 1, int r = m) {
if (u > v) return 0;
if (u <= l && r <= v) return it[id];
int mid = (l + r) >> 1;
int res = 0;
if (u <= mid) maximize(res, get(u, v, id << 1, l, mid));
if (v > mid) maximize(res, get(u, v, id << 1 | 1, mid + 1, r));
return res;
}
} st1, st2;
void solve(){
int res = 0;
REPD(i, n, 1) {
suff[i] = st1.get(a[i][1] + 1, m) + 1;
st1.upd(a[i][1], suff[i]);
maximize(res, suff[i]);
}
REP(i, 1, n) {
maximize(res, suff[i] + st2.get(1, a[i][1] - 1));
pref[i] = st2.get(1, a[i][0] - 1) + 1;
st2.upd(a[i][0], pref[i]);
maximize(res, pref[i]);
}
cout << res << ln;
}
int main(){
sinh_();
io_faster
file();
int t = 1;
// cin >> t;
while (t--){
readip();
solve();
}
}
