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

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.rbegin(), a.rend());
    ll p = 1;
    int ng = -1, ok = 60;
    while(ng + 1 < ok){
        int mid = (ng + ok) / 2;
        int cur = n + mid - 1;
        int idx = max(0, cur - 59);
        priority_queue<ll> pq;
        for(int i = idx; i < n; i++) pq.emplace(a[i]);
        for(int i = min(cur, 59); i >= 0 && !pq.empty(); i--){
            ll v = pq.top();
            pq.pop();
            v -= 1ll << i;
            if(v > 0) pq.emplace(v);
        }
        (pq.empty() ? ok : ng) = mid;
    }
    cout << n + ok << '\n';
}