def min_groups(n,arr,k) :
arr.sort()
count=1
min_value = arr[0]
i=1
while i<len(arr):
if arr[i] > min_value + k :
count+=1
min_value=arr[i]
i+=1
return count
n=int(input())
arr=[]
for i in range(n):
arr.append(int(input()))
k=int(input())
print(min_groups(n,arr,k))