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
#include <iostream>
#include <algorithm>

using namespace std;
unsigned long long n=0;
unsigned long long wykladnik=0;
int main()
{
    cin >> n;
    unsigned long long t[n];
    for(unsigned long long i=0;i<n;i++)
    {
        cin >> t[i];
    }
    sort(t, t+n);
    for(int i=0;i<n;i++)
    {
        if(t[i]==t[i+1])
        {
            wykladnik = t[i]+1;
        }
    }
    cout << wykladnik+1;
    return 0;
}