#include <iostream>
#include <algorithm>
using namespace std;
int main() {
    int zz_2, zz_1, count = 0;
    cin >> zz_2;
    long long a[zz_2], C;
    cin >> C;
    for (int i = 0; i < zz_2; ++i) cin >> a[i];
    sort(a, a+zz_2);
    zz_1 = --zz_2;
    while (zz_2 > 0) {
        if(a[zz_2] > a[zz_1] + C || zz_1 < 0) {
            zz_1 = --zz_2;
        }
        else if(a[zz_2] == a[zz_1] + C) {
            --zz_1, ++count;
        }
        else if (a[zz_2] < a[zz_1] + C) {
            --zz_1;
        }
    }
    cout << count;
    return 0;
 }