import heapq
N = int(input())
heap = sorted(list(map(int,input().split())))
M = len(heap)
hmax = heap[-1]
kmax = 0
while 1<<kmax<=hmax:
    kmax += 1
cnt = 0
for i in range(kmax):
    if M==0:break
    cnt += 1
    heap1 = []
    M1 = 0
    M2 = M
    for _ in range(M2):
        h = heapq.heappop(heap)
        M -= 1
        if h>>i & 1:
            h -= 1<<i
            if h>0:
                heapq.heappush(heap1,h)
                M1 += 1
            break
        if h%(1<<i)>0:
            h -= 1<<i
            if h>0:
                heapq.heappush(heap1,h)
                M1 += 1
            break
        heapq.heappush(heap1,h)
        M1 += 1
    heap += heap1
    M += M1
    heap = sorted(heap)
if M==0:
    print(cnt)
else:
    print(cnt+M)