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

int main(){
	int N;
	cin >> N;
	vector<long long> H(N);
	for(int i=0;i<N;i++) cin >> H[i];
	sort(H.begin(),H.end());
	for(int ans=N;ans<=N+60;ans++){
		priority_queue<long long> A(H.begin(),H.begin()+min((N+60-ans),N));
		for(int i=min(ans-1,59);i>=0 && !A.empty();i--){
			long long pos=A.top();
			A.pop();
			if(pos>=(1LL<<i+1)) goto high;
			else if(pos>=(1LL<<i)) A.push(pos-(1LL<<i));
		}
		cout << ans << '\n';
		return 0;
		high:;
	}
}