#include <bits/stdc++.h>
#include <stdio.h>

#define __Shibae__      signed main()
#define IOS             ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define fiopen(Path)    freopen(Path".INP", "r", stdin); freopen(Path".OUT", "w", stdout);
#define fipen(Path)     freopen(Path".INP", "r", stdin);
#define sz(s)           (int)s.size()
#define all(x)          x.begin(), x.end()
#define maxHeap         priority_queue<int>
#define minHeap         priority_queue<int, vector<int>, greater<int>>
#define getBit(x, k)    (((x) >> (k)) & 1)
#define MASK(i)         (1LL << (i))
#define SQR(x)          (1LL * ((x) * (x)))
#define db              double
#define ld              long double
#define ui              unsigned int
#define ll              long long
#define ii              pair<int, int>
#define pli             pair<ll, int>
#define pil             pair<int, ll>
#define pll             pair<ll, ll>
#define fi              first
#define se              second

#define FOR(i, a, b)    for(int i = a, _b = b; i <= _b; i += 1)
#define FOD(i, a, b)    for(int i = a, _b = b; i >= _b; i -= 1)
#define REP(i, a)       for(int i = 0, _a = a; i < _a; i++)
#define pb              push_back
#define fau(u, a)       for(auto &u : a)

using namespace std;

const ll mod = 1e9 + 7;
const int INF = 1e9 + 7;
const ll INFLL = (ll)2e18 + 7LL;
const ld PI = acos(-1);
const int MAX = 5e5+5;
 
const int dx[] = {1, -1, 0, 0, -1, 1, 1, -1};
const int dy[] = {0, 0, 1, -1, -1, -1, 1, 1};

mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());

ll Rand(ll l, ll r) 
{
    return l + rd() % (r - l + 1);
}

template<class SHIBA, class ENGINE>
    bool minimize(SHIBA &x, const ENGINE y)
    {
        if(x > y)
        {
            x = y;
            return true;
        } 
        else return false;
    }
template<class SHIBA, class ENGINE>
    bool maximize(SHIBA &x, const ENGINE y)
    {
        if(x < y)
        {
            x = y;
            return true;
        }
        else return false;
    }


/* Template by: Nguyen Nhat Anh from Luong Van Chanh High School for the gifted */
/* From Min Tuoi with love */
        /**       TRY HARD        **/
        /**          ORZ          **/

/* -----------------[ MAIN CODE ]----------------- */

int n, x;
int a[MAX];
vector<int> arr;
int ff[MAX];

void input()
{
    cin >> n >> x;
    FOR(i, 1, n)
    {
        cin >> a[i];
        arr.pb(a[i]);
        arr.pb(a[i] + x);
    }
}

struct SegmentTree
{
    int st[MAX << 2];
    int n;

    void build(int _)
    {
        memset(st, 0, sizeof st);
        n = _;
    }

    void update(int p, int k)
    {
        p--;
        for (maximize(st[p += n], k); p > 1; p >>= 1) maximize(st[p >> 1], max(st[p], st[p ^ 1]));
    }

    int get(int l, int r)
    {
        l--;
        int res = 0;
        for (l += n, r += n; l < r; l >>= 1, r >>= 1)
        {
            if (l & 1) maximize(res, st[l++]);
            if (r & 1) maximize(res, st[--r]);
        }
        return res;
    }
}st;

void solve()
{
    sort(all(arr));
    arr.resize(unique(all(arr)) - arr.begin());
    st.build(2*n);

    st.build(2*n);
    int res = 1;

    FOD(i, n, 1)
    {
        int t = lower_bound(all(arr), a[i] + x) - arr.begin() + 1;
        ff[i] = st.get(t+1, 2*n) + 1;
        maximize(res, ff[i]);
        st.update(t, ff[i]);
    }

    st.build(2*n);

    FOR(i, 1, n)
    {
        int t = lower_bound(all(arr), a[i]) - arr.begin() + 1;
        int tt = lower_bound(all(arr), a[i] + x) - arr.begin() + 1;

        maximize(res, st.get(1, tt-1) + ff[i]);

        st.update(t, st.get(1, t-1) + 1);
    }
    assert(*max_element(ff+1, ff+1+n) == st.get(1, 2*n));
    cout << res;
}

__Shibae__
{
    IOS
    fipen("DAYDEP");

    const bool multitest = 0;
    int tt = 1; if(multitest) cin >> tt;
 
    while( tt-- ){
        input();
        solve();
    }
 
    return 0;
}