#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 50, M = 60;
int dp[M][N], n, m;
long long a[N], msk;
int b[M][N];
void chkmn(int &a, int b) {
  if (a > b) a = b;
}
int main() {
  cin >> n;
  long long mx = 0;
  for (int i = 1; i <= n; i++) scanf("%lld", &a[i]), mx = max(mx, a[i]);
  for (int i = 1; i <= n; i++) a[i] = mx - a[i];
  while (mx) mx >>= 1, ++m;
  memset(dp, 0x3f, sizeof(dp));
  for (int t = 0; t <= m + 1; t++) {
    msk = (1ll << (t + 1)) - 1;
    for (int i = 1; i <= n; i++) b[t][i] = i;
    sort(b[t] + 1, b[t] + n + 1, [](const int &i, const int &j) {
      return (a[i] & msk) < (a[j] & msk);
    });
    if (t == 0) {
      int c = 0;
      for (int i = 1; i <= n; i++) c += a[i] >> t & 1;
      dp[0][c] = n - c, dp[0][0] = c;
      continue;
    }
    int c = 0;
    for (int i = 1; i <= n; i++) c += a[i] >> t & 1;
    for (int i = 0, k = 0; i <= n; i++) {
      chkmn(dp[t][k], dp[t - 1][i] + c);
      if (a[b[t - 1][n - i]] >> t & 1)
        c -= 1, ++k;
      else
        c += 1;
    }
    c = 0;
    for (int i = 1; i <= n; i++) c += a[i] >> t & 1;
    for (int i = 0, k = c; i <= n; i++) {
      chkmn(dp[t][k], dp[t - 1][i] + n - c);
      if (a[b[t - 1][n - i]] >> t & 1)
        c -= 1;
      else
        c += 1, ++k;
    }
  }
  cout << dp[m + 1][0];
  return 0;
}
