#include <bits/stdc++.h>
const int MAX_N = int(1e5), LOGN = 60;
const long long MAX_LONG = (1LL << 60);
int n, sum[MAX_N + 5];
long long a[MAX_N + 5], dp[LOGN + 5][MAX_N + 5];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    scanf("%I64d", a + i);
  }
  std::sort(a + 1, a + n + 1);
  for (int i = 1; i <= n; ++i) {
    a[i] = a[n] - a[i];
  }
  for (int i = 0; i <= LOGN; ++i) {
    for (int j = 0; j <= n; ++j) {
      dp[i][j] = MAX_LONG;
    }
  }
  dp[0][0] = 0;
  for (int i = 1; i <= LOGN; ++i) {
    for (int j = 1; j <= n; ++j) {
      sum[j] = sum[j - 1] + (a[j] >> (i - 1) & 1);
    }
    for (int j = 0; j <= n; ++j) {
      if (dp[i - 1][j] != MAX_LONG) {
        int cnt = j - sum[j] + sum[n] - sum[j];
        dp[i][sum[j]] = std::min(dp[i][sum[j]], dp[i - 1][j] + cnt);
        cnt = sum[j] + (n - j) - (sum[n] - sum[j]);
        dp[i][j + sum[n] - sum[j]] =
            std::min(dp[i][j + sum[n] - sum[j]], dp[i - 1][j] + cnt);
      }
    }
    std::sort(a + 1, a + n + 1, [&](const long long &x, const long long &y) {
      return x % (1LL << (i)) > y % (1LL << (i));
    });
  }
  printf("%I64d\n", dp[LOGN][0]);
}
