#include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
const int inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3fLL;
const double PI = acos(-1.0);
const long double eps = 1e-8;
const int mod = 998244353;
const int maxn = 2e5 + 100;
const int N = 2e5 + 100;
const int M = (1 << 20) + 10;
const long long mm = (1LL << 32);
template <class T>
inline void read(T &x) {
  x = 0;
  char c = getchar();
  bool f = 0;
  for (; !isdigit(c); c = getchar()) f ^= c == '-';
  for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
  x = f ? -x : x;
}
template <class T>
inline void write(T x) {
  if (x < 0) {
    putchar('-');
    x = -x;
  }
  T y = 1;
  int len = 1;
  for (; y <= x / 10; y *= 10) ++len;
  for (; len; --len, x %= y, y /= 10) putchar(x / y + 48);
}
long long qpow(long long a, long long b, long long mod) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = (ans * a) % mod;
    b >>= 1;
    a = (a * a) % mod;
  }
  return ans;
}
int cnt[N * 32];
int rt, tot = 0;
int tr[N * 32][2];
void add(int val) {
  rt = 0;
  for (int i = 30; i >= 0; --i) {
    int x = (val >> i) & 1;
    if (!tr[rt][x]) tr[rt][x] = ++tot;
    rt = tr[rt][x];
    cnt[rt]++;
  }
}
int ans;
void dfs(int x, int dep, int res) {
  if (dep == 30) {
    ans = min(res, ans);
    return;
  }
  int l = tr[x][0], r = tr[x][1];
  if (!l)
    dfs(r, dep + 1, res);
  else if (!r)
    dfs(l, dep + 1, res);
  else {
    dfs(l, dep + 1, res + cnt[r] - 1);
    dfs(r, dep + 1, res + cnt[l] - 1);
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  for (int i = 1; i <= n; ++i) {
    int x;
    cin >> x;
    add(x);
  }
  ans = inf;
  dfs(0, 0, 0);
  cout << ans;
  return 0;
}
