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

#define For(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i, n) For(i, 0, n)
#define rFor(i, a, b) for(int i = (a); i >= (b); i--)
#define ALL(v) (v).begin(), (v).end()
#define rALL(v) (v).rbegin(), (v).rend()
#define SZ(v) ((int)(v).size())

using lint = long long;
using ld = long double;

const int INF = 2000000000;
const lint LINF = 1000000000000000000;
// 真上から反時計回り
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int di8[] = {-1, -1, 0, 1, 1, 1, 0, -1};
const int dj8[] = {0, -1, -1, -1, 0, 1, 1, 1};

struct SetupIo {
    SetupIo() {
        ios::sync_with_stdio(false); cin.tie(nullptr);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(15);
    }
} setupio;

template <class T>
bool chmin(T &a, const T &b) {
    return a > b ? a = b, 1 : 0;
}
template <class T>
bool chmax(T &a, const T &b) {
    return a < b ? a = b, 1 : 0; 
}
template <class T>
T mypow(T a, T b) {
    T res = 1;
    while (b) {
        if (b & 1) { res *= a; }
        a *= a; b >>= 1;
    }
    return res;
}
template <class T>
T modpow(T a, T b, T mod) {
    T res = 1;
    while (b) {
        if (b & 1) { res = (res * a) % mod; }
        a = (a * a) % mod; b >>= 1;
    }
    return res;
}

int main() {
    int N;
    cin >> N;
    vector<lint> H(N);
    rep(i, N) {
        cin >> H[i];
    }

    auto judge = [&](lint x) -> bool {
        priority_queue<lint> pq;
        rep(i, N) {
            pq.emplace(H[i]);
        }
        for (lint t = x - 1; t >= 0; t--) {
            auto mx = pq.top();
            pq.pop();
            if (t < 60) {
                lint rest = mx - (1LL << t);
                if (rest > 0) {
                    pq.emplace(rest);
                }
            }
            if (pq.empty()) {
                return true;
            }
        }
        return false;
    };

    lint wa = 0, ac = 1000000000;
    while (ac - wa > 1) {
        lint wj = (wa + ac) / 2;
        (judge(wj) ? ac : wa) = wj;
    }

    cout << ac << "\n";
}