N = int(input())
H = sorted(list(map(int, input().split())))

ans = N+max(h.bit_length()-i-1 for i, h in enumerate(H))
pre = 1<<60
while sum(H):
    h = [a for a in H if a]
    H = sorted(h)
    MAX = max(h.bit_length()-i-1 for i, h in enumerate(H))
    if pre < MAX+len(H):
        exit(print(ans+1))
    for i in range(len(H)):
        if MAX+i < 60:
            H[i] = max(H[i]-(1<<(MAX+i)), 0)
        else:
            H[i] = 0

print(ans)