import heapq

n = int(input())
a = [int(input()) for _ in range(n)]
a.sort()

heap = []
for x in a:
    if heap and x > heap[0] + 1:
        heapq.heappop(heap)
    heapq.heappush(heap, x)

print(len(heap))