#include <iostream>
#include <iostream>
#include <algorithm>
#include <iterator>
using namespace std;
uint32_t ZnajdzBrakujacaLiczba( uint32_t* tablica, uint32_t N )
{
if ( N == 0 ) return 0;
sort( tablica, tablica+N );
uint32_t ilosc_duplikatow = 0;
for(uint32_t i = 1; i < N; ++i )
{
if (tablica[i] > (tablica[i - 1] + 1))
{
return tablica[i - 1] + 1;
}
}
uint32_t ostatni_element = tablica[ N - 1 ];
return ostatni_element + 1;
}
int main()
{
uint32_t tab[10] = {0,1,2,2,2,2,3,2,1,0};
uint32_t wynik = ZnajdzBrakujacaLiczba(tab, 10);
cout << wynik;
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8aW9zdHJlYW0+CiNpbmNsdWRlIDxhbGdvcml0aG0+CiNpbmNsdWRlIDxpdGVyYXRvcj4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCnVpbnQzMl90IFpuYWpkekJyYWt1amFjYUxpY3piYSggdWludDMyX3QqIHRhYmxpY2EsIHVpbnQzMl90IE4gKQp7CiAgICBpZiAoIE4gPT0gMCApIHJldHVybiAwOwogCiAgICBzb3J0KCB0YWJsaWNhLCB0YWJsaWNhK04gKTsKICAgIHVpbnQzMl90IGlsb3NjX2R1cGxpa2F0b3cgPSAwOwogICAgCiAgICBmb3IodWludDMyX3QgaSA9IDE7IGkgPCBOOyArK2kgKSAKICAgIHsKICAgICAgICBpZiAodGFibGljYVtpXSA+ICh0YWJsaWNhW2kgLSAxXSArIDEpKSAKICAgICAgICB7CiAgICAgICAgCXJldHVybiB0YWJsaWNhW2kgLSAxXSArIDE7CiAgICAgICAgfQogICAgfQogCiAgICB1aW50MzJfdCBvc3RhdG5pX2VsZW1lbnQgPSB0YWJsaWNhWyBOIC0gMSBdOwogICAgcmV0dXJuIG9zdGF0bmlfZWxlbWVudCArIDE7Cn0KCmludCBtYWluKCkgCnsKCXVpbnQzMl90IHRhYlsxMF0gPSB7MCwxLDIsMiwyLDIsMywyLDEsMH07Cgl1aW50MzJfdCB3eW5payA9IFpuYWpkekJyYWt1amFjYUxpY3piYSh0YWIsIDEwKTsKCWNvdXQgPDwgd3luaWs7CglyZXR1cm4gMDsKfQ==