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
#include<iostream>
#include <algorithm>
using namespace std;
int main()
{
	int n;
	cin >> n;
	int a[n];
	for(int i=0;i<n;i++){
		cin >> a[i];
	}
	sort( a, a + n);
	int i = 0;
	while(i<n){
		if(a[i] == a[i+1]) a[i+1]++;
		else if((a[i] > a[i+1]) && (a[i+1] == a[i+2])){
			a[i+2] = a[i] + 1;
		}
		else if(a[i] > a[i+1]) a[i+1] = a[i];
		i++;

	}
	cout<<a[n-1];
	
	
	
	return 0;
}