#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const int N = 100010;
int n, dp[61][N];
struct dat {
  long long a, b;
} a[N];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  scanf("%d", &n);
  long long ma = 0;
  for (int i = (1); i <= (n); ++i) scanf("%lld", &a[i].a), ma = max(ma, a[i].a);
  for (int i = (1); i <= (n); ++i) a[i].a = ma - a[i].a;
  for (int i = (0); i <= (60); ++i)
    for (int j = (0); j <= (n); ++j) dp[i][j] = 1e8;
  dp[0][0] = 0;
  for (int i = (1); i <= (60); ++i) {
    long long tmp = (1ll << i - 1) - 1;
    for (int j = (1); j <= (n); ++j) a[j].b = a[j].a & tmp;
    sort(a + 1, a + n + 1, [](dat x, dat y) { return x.b > y.b; });
    int num1 = 0, cnt = 0;
    for (int j = (1); j <= (n); ++j)
      if (a[j].a & (1ll << i - 1)) ++num1;
    for (int j = (0); j <= (n); ++j) {
      if (a[j].a & (1ll << i - 1)) ++cnt;
      dp[i][cnt] = min(dp[i][cnt], num1 + j - 2 * cnt + dp[i - 1][j]);
      dp[i][num1 + j - cnt] =
          min(dp[i][num1 + j - cnt], n - num1 - j + 2 * cnt + dp[i - 1][j]);
    }
  }
  printf("%d\n", dp[60][0]);
  return 0;
}
