n = int(input())
H = list(map(int, input().split()))
H.sort()
ans = 0
if n > 63:
    ans += n - 63
    H = H[:63]
    n = 63

def f(a, t):
    if a >> t & 1:
        now = t + 1
        while a >> now & 1:
            now += 1
        s = 1 << now
        a = a // s * s + s
    return a

m = n
for i in range(63):
    ans += 1
    if H[0] <= 1 << i:
        H[0] = 0
    else:
        for j in range(m):
            if H[j] >> i & 1:
                H[j] ^= 1 << i
                break
    H.sort()
    if H[0] == 0:
        H = H[1:]
        m -= 1
    if m == 0:
        break
    H = [f(H[j], i) for j in range(m)]

print(ans)