N = int(input())
H = [0]+sorted(list(map(int,input().split())))
kmax = 0
while 1<<kmax <= H[-1]:
    kmax += 1
dp = [[0 for _ in range(kmax+1)] for _ in range(N+1)]
for j in range(kmax+1):
    if j>=len(bin(H[1])[2:]):
        dp[1][j] = 1
for i in range(2,N+1):
    for j in range(1,kmax+1):
        dp[i][j] = dp[i-1][j]
        if j>=len(bin(H[i])[2:]):
            dp[i][j] = max(dp[i][j],dp[i-1][j-1]+1)
print(kmax+N-dp[N][kmax])