ll@n,@h[n];
sortA(n,h);
ll a=n-1,b=n+63;
while(a+1<b){
	ll c=a+b>>1;
	ll d=min(60,c);
	priority_queue<ll>q;
	rep(i,n-(c-d)){
		q.push(h[i]);
	}
	ll e=1ll<<d-1;
	while(q.size()&&e){
		ll f=q.top();
		q.pop();
		f-=e;
		if(f>0){
			q.push(f);
		}
		e>>=1;
	}
	(q.size()?a:b)=c;
}
wt(b);