For this Question: You are given a sequence of length N consisting of integers: 
A=(A<sub>1</sub>, A<sub>2</sub>,...., A<sub>N</sub>)
Find the smallest non-negative integer not in (A<sub>1</sub>, A<sub>2</sub>,....,A<sub>N</sub>).The input contains N and elements of sequence separated by a new line.
N 
A<sub>1</sub>, A<sub>2</sub>,. , A<sub>N</sub>

<b>Constraints</b>
1&le;N&le;2000
0&le;Ai&le;2000
All values in the input are integers.Print the answer.<b>Sample Input 1</b> 
8
0 3 2 6 2 1 0 0
<b>Sample Output 1</b> 
4

<b>Sample Input 2</b> 
3
2000 2000 2000
<b>Sample Output 2</b> 
0, I have written this Solution Code: #include<bits/stdc++.h>
using namespace std;
using LL = long long;
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N;
    cin >> N;
    set<int> s;
    for (int i = 0, A; i < N; i += 1) {
        cin >> A;
        s.insert(A);
    }
    int ans = 0;
    while (s.count(ans)) ans += 1;
    cout << ans;
    return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?