#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll th = 1'000'000'000'000'000'000ll;

int solve(int n, vector<ll> a){
    ll p = 1;
    int ans = 0;
    for(auto v : a){
        while(v >= 1){
            ans++;
            v -= p;
            p = min(2 * p, th);
        }
    }
    return ans;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    vector<ll> a(n);
    for(auto &&v : a) cin >> v;
    sort(a.begin(), a.end());
    int ans = solve(n, a);
    ll sumv = 0;
    for(auto v : a){
        sumv += v;
        if(sumv >= th) break;
    }
    if(sumv < th){
        ans = min(ans, (int)__lg(sumv) + 1);
    }
    cout << ans << '\n';
}