#include <cstdio>
#include <cstring>
#include <algorithm>
#define FILEIO(filename) (freopen(filename ".in", "r", stdin), freopen(filename ".out", "w", stdout))
typedef long long ll;
typedef unsigned long long ull;
const int N = 100005;
int n;
ll a[N], f[62];
int main(void)
{
    scanf("%d", &n);
    for (int i = 1;i <= n;++i)
        scanf("%lld", a + i);
    for (int i = 0; i < 62;++i)
        f[i] = 1;
    for (int i = 1; i < n; ++i)
    {
        ++f[0];
        ll len = a[i + 1] - a[i];
        for (int k = 61; k >= 1; --k)
            if(len >= (1ll << k) - 1)
            {
                f[k] += 1 << (k - 1);
            }
            else if(len >= (1ll << (k - 1)))
            {
                ll val = len - (1 << (k - 1)) + 1;
                f[k] = std::max(f[i] + val, f[k - 1] + val + 1);
            }
        for (int k = 1; k < 62;++k)
            f[k] = std::max(f[k], f[k - 1]);
    }
    printf("%lld\n", f[61]);
    return 0;
}