2 1
1 1
 4 1
2 2 1 1
 10 1
2 6 3 4 2 4 4 3 2 1
 2 1
999152 999153
 8 1000000
1 1 5 1000000 1000000 2 2 2
 9 2
1 6 1 5 5 8 6 8 7
 15 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
 1 4
8
 10 1
6 3 1 3 6 4 1 3 6 4
 10 1
1 2 3 5 6 8 10 11 9 4
 7 2
1 5 5 8 9 8 8
 2 1000000
1 1000000
 8 2
3 13 9 8 3 13 9 14
 1 1
1
 2 1
1 2

2
 2
 4
 1
 2
 4
 15
 1
 7
 2
 4
 1
 5
 1
 1

#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int re = 0, flag = 1;
  char ch = getchar();
  while (ch > '9' || ch < '0') {
    if (ch == '-') flag = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9')
    re = (re << 1) + (re << 3) + ch - '0', ch = getchar();
  return re * flag;
}
int n, K, a[200010];
int main() {
  n = read();
  K = read();
  int i, j, cur = 0, ans = 0, pretot = 0, tot;
  for (i = 1; i <= n; i++) a[i] = read();
  sort(a + 1, a + n + 1);
  for (i = 1; i <= n; i++) {
    tot = 1;
    while (a[i + 1] == a[i]) tot++, i++;
    if (cur < a[i] || cur - K == a[i]) ans += pretot;
    cur = a[i] + K;
    pretot = tot;
  }
  ans += pretot;
  printf("%d\n", ans);
}
