1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <cstdio>
#include <queue>
#include <vector>
#include <algorithm>

using namespace std;

int n;
priority_queue<int, vector<int>, greater<int>> pq;

int main() {
	scanf("%d", &n);
	for (int i = 0; i < n; i++) {
		int a;
		scanf("%d", &a);
		pq.push(a);
	}
	while (pq.size() > 1) {
		int a, b;
		a = pq.top(); pq.pop();
		b = pq.top(); pq.pop();
		if (a == b) {
			pq.push(a + 1);
		} else {
			pq.push(max(a, b));
		}
	}
	printf("%d\n", pq.top());
	return 0;
}