#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n, dp[70][N];
long long a[N];
inline void umn(int &x, int y) { (x > y) && (x = y); }
int main() {
  scanf("%d", &n);
  for (int i = (1); i <= (n); ++i) scanf("%lld", a + i);
  sort(a + 1, a + n + 1);
  for (int i = (1); i <= (n); ++i) a[i] = a[n] - a[i];
  for (int i = (0); i <= (61); ++i)
    for (int j = (0); j <= (n); ++j) dp[i][j] = 1e9;
  dp[0][0] = 0;
  for (int i = (0); i <= (60); ++i) {
    int cnt = 0, cur = 0;
    sort(a + 1, a + n + 1, [&](long long x, long long y) {
      return (x & ((1ll << i) - 1)) > (y & ((1ll << i) - 1));
    });
    for (int j = (1); j <= (n); ++j) cnt += a[j] >> i & 1;
    for (int j = (0); j <= (n); ++j) {
      cur += a[j] >> i & 1;
      int A = cur, B = j - A, C = cnt - cur, D = n - j - C;
      umn(dp[i + 1][A + B + C], dp[i][j] + A + D);
      umn(dp[i + 1][A], dp[i][j] + B + C);
    }
  }
  printf("%d\n", dp[61][0]);
  return 0;
}
