#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
const int N = 2000086, MOD = 998244353, INF = 0x3f3f3f3f;
int n, m, w[N];


ll h[N];
int main() {
    cin >> n;
    for (int i = 1; i < n + 1; i++) scanf("%lld", h + i);
    sort(h + 1, h + n + 1);
    ll t = 0, res = 0;
    for (int i = 1; i < n + 1; i++) {
        if (t + h[i] < (1ll << 62)) t += h[i];
        else res++;
    }
    if (res) printf("%lld\n", res + 62);
    else 
        for (int i = 62; ~i; i--)
            if (t >> i & 1) {
                printf("%d\n", i + 1);
                return 0;
            }
    return 0;
}