#include <bits/stdc++.h>
using namespace std;
const long long INF = 9223372036854775807;
const long long MOD = 1000000007;
const long double PI = acos(-1);
inline long long power(long long a, long long b, long long z = MOD) {
  long long res = 1;
  a = (a % z);
  while (b) {
    if (b & 1) res = (res * a) % z;
    a = (a * a) % z;
    b = b >> 1;
  }
  return res;
}
inline long long inverse(long long a, long long z = MOD) {
  return power(a, z - 2, z);
}
long long extend(long long a, long long b, long long &x, long long &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  long long x1, y1;
  long long g = extend(b, a % b, x1, y1);
  x = y1;
  y = x1 - (a / b) * y1;
  return g;
}
inline long long mat_power(long long a, long long b, long long c, long long d,
                           long long n, long long z = MOD) {
  long long a0 = 1, b0 = 0, c0 = 0, d0 = 1;
  while (n) {
    if (n & 1) {
      long long a1 = a0, b1 = b0, c1 = c0, d1 = d0;
      a0 = (a1 * a + b1 * c) % z;
      b0 = (a1 * b + b1 * d) % z;
      c0 = (c1 * a + d1 * c) % z;
      d0 = (c1 * b + d1 * d) % z;
    }
    long long a1 = a, b1 = b, c1 = c, d1 = d;
    a = (a1 * a1 + b1 * c1) % z;
    b = (a1 * b1 + b1 * d1) % z;
    c = (c1 * a1 + d1 * c1) % z;
    d = (c1 * b1 + d1 * d1) % z;
    n = n >> 1;
  }
  return c0;
}
int two[32];
int f(vector<int> aray) {
  int n = aray.size();
  if (n == 1) return 1;
  vector<int> bits[32];
  for (int i = 0; i < n; i++) {
    int c = 0, x = aray[i];
    while (x) {
      x = x >> 1;
      c++;
    }
    if (c == 0)
      bits[c].push_back(aray[i]);
    else
      bits[c].push_back(aray[i] - two[c - 1]);
  }
  vector<pair<int, int> > v;
  for (int i = 31; i >= 0; i--) {
    if (bits[i].size()) v.push_back(make_pair(bits[i].size(), i));
  }
  if (v.size() == 1) return f(bits[v[0].second]);
  int sum = 0;
  for (int i = 0; i < v.size(); i++) {
    if (i == v.size() - 1)
      sum = max(sum, f(bits[v[i].second]) + i);
    else
      sum = max(sum, f(bits[v[i].second]) + i + 1);
  }
  return sum;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  two[0] = 1;
  for (int i = 1; i < 32; i++) two[i] = two[i - 1] << 1;
  int n, x;
  cin >> n;
  vector<int> v;
  for (int i = 0; i < n; i++) {
    cin >> x;
    v.push_back(x);
  }
  cout << n - f(v) << "\n";
  return 0;
}
