#include <bits/stdc++.h>
using namespace std;
long long a[100005];
long long dp[65][100005];
long long k = 0;
bool cmp(long long a, long long b) {
  long long t = (1ll << k) - 1;
  return (a & t) > (b & t);
}
int main() {
  int n;
  scanf("%d", &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];
  }
  memset(dp, 0x3f3f3f3f, sizeof(dp));
  for (k = 0; k < 63; k++) {
    sort(a + 1, a + n + 1, cmp);
    int OneNum = 0;
    for (int i = 1; i <= n; i++) {
      if (a[i] >> k & 1) OneNum++;
    }
    int one = 0, zero = 0;
    if (k != 0) {
      for (int i = 1; i <= n; i++) {
        if (a[i] >> k & 1)
          one++;
        else
          zero++;
        dp[k][one] = min(dp[k][one], dp[k - 1][i] + OneNum - one + zero);
        dp[k][i + OneNum - one] = min(dp[k][i + OneNum - one],
                                      dp[k - 1][i] + one + n - OneNum - zero);
      }
      dp[k][0] = min(dp[k][0], dp[k - 1][0] + OneNum);
      dp[k][OneNum] = min(dp[k][OneNum], dp[k - 1][0] + n - OneNum);
    } else {
      dp[k][0] = min(dp[k][0], 1LL * OneNum);
      dp[k][OneNum] = min(dp[k][OneNum], 1LL * (n - OneNum));
    }
  }
  printf("%d\n", dp[62][0]);
  return 0;
}
