#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <set>
#include <stack>
#include <limits.h>
#include <math.h>
#include <iomanip>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <cstring>
#include <sstream>
#pragma GCC target("popcnt")
typedef long long ll;
typedef long double ld;
using namespace std;
const int MOD=1e9+7;
typedef pair<ll,ll>point;
//#define x first
//#define y second
int n,x;
int arr[200000];
int dp1[200000];
int dp2[200000];
int dp3[200000];
int main(){
ios::sync_with_stdio(false);
cout.tie(NULL);
cin.tie(NULL);
//freopen("speeding.in","r",stdin);
//freopen("speeding.out","w",stdout);
cin>>n>>x;
for(int i=0;i<n;i++)
cin>>arr[i];
for(int curr=0;curr<n;curr++){
dp1[curr]=1;
for(int i=0;i<curr;i++){
if(arr[i]<arr[curr])
dp1[curr]=max(dp1[curr],dp1[i]+1);
}
}
for(int curr=0;curr<n;curr++){
dp2[curr]=1;
for(int i=curr+1;i<n;i++){
if(arr[curr]<arr[i])
dp2[curr]=max(dp2[curr],dp2[i]+1);
}
}
for(int curr=0;curr<n;curr++){
dp3[curr]=1;
for(int i=curr+1;i<n;i++){
if(arr[curr]-x<arr[i])
dp3[curr]=max(dp3[curr],dp2[i]+1);
}
}
int res=0;
for(int i=0;i<n;i++)
res=max(res,dp1[i]+dp3[i]-1);
cout<<res<<"\n";
return 0;
}
/*
8 10
7 3 5 12 2 7 3 4
*/
