#include "bits/stdc++.h"
#include<vector>
#include<iostream>
#include<queue>
#include<algorithm>
#include<map>
#include<set>
#include<iomanip>
#include<assert.h>
#include<unordered_map>
#include<unordered_set>
#include<string>
#include<stack>
#include<complex>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
template<class T>
using Table = vector<vector<T>>;
const ld eps=1e-9;

#define WHATS(var)cout<<__LINE__<<' '<<#var<<"="<<var<<endl;

template<class S, class T> ostream& operator <<(ostream &os, const pair<S, T> v){
os << "( " << v.first << ", " << v.second << ")"; return os;
}
template<class T> ostream& operator <<(ostream &os, const vector<T> &v){
for(int i = 0; i < v.size(); i++){if(i > 0){os << " ";} os << v[i];} return os;
}
template<class T> ostream& operator <<(ostream &os, const vector<vector<T>> &v){
for(int i = 0; i < v.size(); i++){if(i > 0){os << endl;} os << v[i];} return os;
}
template<class T> ostream& operator <<(ostream &os, const vector<set<T>> &v){
for(int i = 0; i < v.size(); i++){if(i > 0){os << endl;} os << v[i];} return os;
}
template<class T> ostream& operator <<(ostream &os, const set<T> &v){
int i=0;
for(auto it:v){
	if(i > 0){os << ' ';}
	os << it;
	i++;
} 
return os;
}


using ll=long long ;


struct node{
	int l;
	int r;
	shared_ptr<node>chl,chr;
	node(int l,int r):l(l),r(r){
		chl=nullptr;
		chr=nullptr;
	}
};
void add(shared_ptr<node>no,int x){
	int l=no->l;
	int r=no->r;
	if(l+1==r){

	}else{
		int m((l+r)/2);
		if(x<m){
			if(no->chl==nullptr){
				no->chl=make_shared<node>(l,m);
			}
			add(no->chl,x);

		}else{
			if(no->chr==nullptr){
				no->chr=make_shared<node>(m,r);

			}
			add(no->chr,x);
		}	
	}
}
int solve(shared_ptr<node>no){
	int l=no->l;
	int r=no->r;
	//WHATS(l)
	//WHATS(r)
	if(l+1==r){
		return 0;
	}else{
		int m((l+r)/2);
		if(no->chl==nullptr){
			return solve(no->chr);
		}else if(no->chr==nullptr){
			return solve(no->chl);
		}else{
			int am=solve(no->chl);
			int bm=solve(no->chr);
			return (r-l)/2+min(am,bm);
		}
	}
}
int main() {
	ios::sync_with_stdio(false);
	int N;cin>>N;
	shared_ptr<node>root=make_shared<node>(0,(1<<30));
	for(int i=0;i<N;++i){
		int a;cin>>a;
		add(root,a);
	}	
	int ans=solve(root);
	cout<<ans<<endl;
	
	return 0;
}