#include <bits/stdc++.h>
using namespace std;
// #include<atcoder/all>
// using mint = atcoder::modint998244353;
using ld = long double;
#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(int)(n);++i)
template<typename T>bool chmin(T&a,T b){return b<a?(a=b,1):0;}
template<typename T>bool chmax(T&a,T b){return b>a?(a=b,1):0;}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int N;
    cin>>N;
    vector<long> A(N);
    rep(i,N)cin>>A[i];
    sort(all(A));

    if(N<=60){
        rep(b,60){
            priority_queue<long> pq;
            rep(i,N) pq.push(A[i]);
            for(long i=1l<<(b);i;i>>=1){
                if(pq.empty()) break;
                long t=pq.top();
                pq.pop();
                t-=i;
                if(t>=1) pq.push(t);
            }
            if(pq.empty()){
                cout<<b+1<<"\n";
                return 0;
            }
        }
    }

    int ans=1e9;
    rep(s,min(N+1,60+1)){
        priority_queue<long> pq;
        rep(i,s){
            pq.push(A[i]);
        }
        for(long i=1l<<60;i;i>>=1l){
            if(pq.empty()) break;
            long t=pq.top();
            pq.pop();
            t-=i;
            if(t>=1) pq.push(t);
        }
        if(pq.empty()){
            chmin(ans, (N-s)+60);
        }
    }
    cout<<ans<<"\n";
}