E.cpp

// #pragma GCC optimize("Ofast,unroll-loops")
// #pragma GCC target("avx,avx2,fma")

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ull unsigned long long
#define dd double
#define ld long double
#define sl(n) scanf("%lld", &n)
#define si(n) scanf("%d", &n)
#define sd(n) scanf("%lf", &n)
#define pll pair <ll, ll>
#define pii pair <int, int>
#define mp make_pair
#define pb push_back
#define all(v) v.begin(), v.end()
#define inf (1LL << 61)
#define loop(i, start, stop, inc) for(ll i = start; i <= stop; i += inc)
#define for1(i, stop) for(ll i = 1; i <= stop; ++i)
#define for0(i, stop) for(ll i = 0; i < stop; ++i)
#define rep1(i, start) for(ll i = start; i >= 1; --i)
#define rep0(i, start) for(ll i = (start-1); i >= 0; --i)
#define ms(n, i) memset(n, i, sizeof(n))
#define casep(n) printf("Case %lld:", ++n)
#define pn printf("\n")
#define pf printf
#define EL '\n'
#define fastio std::ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);

const ll sz = 2e5 + 10;
ll ara[sz];

ll solve(ll l, ll r, ll bit)
{
    if(l > r) return 0;
    if(bit < 0) return 0;

    ll lft = l-1, ltot = 0, rgt = r+1, rtot = 0;

    for(ll i = r; i >= l; i--) {
        bool b = (ara[i] >> bit) & 1;
        if(!b) {
            lft = i;
            break;
        }
    }

    ltot = max(0LL, lft-l+1), rtot = max(0LL, r-lft);

    ll cst1 = max(0LL, ltot-1), cst2 = max(0LL, rtot-1);

    return min(cst1 + solve(lft+1, r, bit-1), cst2 + solve(l, lft, bit-1));
}

int main()
{
    ll n;
    sl(n);

    for1(i, n) sl(ara[i]);
    sort(ara+1, ara+n+1);

    ll ans = solve(1, n, 30);

    cout << ans << EL;

    return 0;
}