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

/**
 * Created by CUONG on 6/10/2018.
 */
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
public class Bacteria {
    public static void main(String[] args) throws IOException
    {
        BufferedReader br= new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st= new StringTokenizer(br.readLine());
        int n= Integer.parseInt(st.nextToken());
        int k= Integer.parseInt(st.nextToken());
        ArrayList<Integer> temp= new ArrayList<>();

        st= new StringTokenizer(br.readLine());
        for (int i=0; i<n; i++)
        {
            temp.add(Integer.parseInt(st.nextToken()));
        }
        Collections.sort(temp);
        int ans=1;

        Integer[] bact= temp.toArray(new Integer[n]);
        boolean[] swallow= new boolean[n];

        for (int i=n-2; i>=0; i--)
        {
            if (bact[i]==bact[i+1])
            {
                if (!swallow[i+1]) ans++;
                else swallow[i]=true;
            }
            else if (bact[i]<bact[i+1] && bact[i]+k<bact[i+1])
            {
                ans++;
            }
            else swallow[i]=true;


        }
        System.out.println(ans);
    }
}
