#include "iostream"
#include "algorithm"
#include "cstring"
#include "cstdio"
#include "cmath"
#include "vector"
#include "map"
#include "set"
#include "queue"
using namespace std;
#define int long long
#define rep(i, a, b) for (int i = (a), i##end = (b); i <= i##end; ++i)
#define per(i, a, b) for (int i = (a), i##end = (b); i >= i##end; --i)
#define pii pair<int,int>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define all(x) (x).begin() , (x).end()
#define mem( a ) memset( a , 0 , sizeof a )
typedef long long ll;
#define P 1000000007
const int MAXN = 5e5 + 20;
int n;
int A[MAXN] , num0[MAXN] , num1[MAXN];

void solve() {
    cin >> n;
    rep( i , 1 , n ) scanf("%lld",A + i);

    int tn = n , res = 1 , ser = 0;
    while( tn > 1 ) {
        tn >>= 1;
        int msk = ~( ( tn << 1 ) - 1 );
        int re0 = 0 , re1 = 0;
        rep( i , 0 , n - 1 ) num0[i] = num1[i] = 0;
        rep( i , 1 , n ) {
            if( A[i] & tn ) {
                re0 += num0[A[i] & msk];
                ++ num1[A[i] & msk];
            } else {
                re1 += num1[A[i] & msk];
                ++ num0[A[i] & msk];
            }
        }
        ser += re1;
        res += min( re0 , re1 );
    }
    // cout << ser << endl;
    cout << min( res , ser ) << endl;
}

signed main() {
    // freopen("bird.in","r",stdin),freopen("bird.out","w",stdout);
//    int T;cin >> T;while( T-- ) solve();
    solve();
}