#include <bits/stdc++.h>
const int inf = 1e9;
long long a[100005], f[65][100005], U;
int n, s[100005];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%lld", &a[i]);
  long long M = *std::max_element(a + 1, a + n + 1);
  for (int i = 1; i <= n; ++i) a[i] = M - a[i];
  for (int i = 0; i <= 63; ++i)
    for (int j = 0; j <= n; ++j) f[i][j] = inf;
  f[0][0] = 0;
  for (int i = 0; i <= 62; ++i) {
    for (int j = 1; j <= n; ++j) s[j] = s[j - 1] + ((a[n - j + 1] >> i) & 1);
    U = (1ll << (i + 1)) - 1;
    std::sort(a + 1, a + n + 1,
              [](long long a, long long b) { return (a & U) < (b & U); });
    int sum = s[n];
    for (int j = 0; j <= n; ++j) {
      int c11 = s[j];
      int c10 = sum - s[j];
      int c01 = j - s[j];
      int c00 = (n - j) - (sum - s[j]);
      f[i + 1][c11] = std::min(f[i + 1][c11], f[i][j] + c10 + c01);
      f[i + 1][c11 + c10 + c01] =
          std::min(f[i + 1][c11 + c10 + c01], f[i][j] + c11 + c00);
    }
  }
  printf("%lld", f[63][0]);
  return 0;
}
