// 長い夜の終わりを信じながら
// Think twice, code once.
#include <map>
#include <cstdio>
#include <string>
#include <cstring>
#include <iostream>
#include <algorithm>
#define eputchar(c) putc(c, stderr)
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#define eputs(str) fputs(str, stderr), putc('\n', stderr)
using namespace std;

int n;
long long a[100005], dp[100005][65], num[65];

int main() {
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) scanf("%lld", &a[i]);
	fill(dp[1], dp[1] + 60, 1);
	for (int i = 2; i <= n; i++) {
		dp[i][0] = dp[i - 1][0] + 1;
		long long tot = a[i] - a[i - 1] - 1;
		for (int j = 1; j <= 60; j++) {
			num[j] = min(tot, 1ll << (j - 1));
			tot -= num[j];
		}
		for (int j = 1; j <= 60; j++) {
			long long val =
				j == 1 ? 0 : (num[j - 1] * 2 == num[j] ? num[j] : max(num[j] + 1, num[j - 1] + 1));
			dp[i][j] = max(dp[i - 1][j] + num[j], dp[i - 1][j - 1] + val);
			dp[i][j] = max(dp[i][j], dp[i][j - 1]);
		}
	}
	printf("%lld\n", dp[n][60]);
	return 0;
}