For this Question: While Solo was playing with an array A of N integers, her little sister Tono asked her the following question:
For each integer i from 1 to N, find the smallest non- negative integer that is missing in subarray A[0]...A[i-1].

As Solo wants to play, please help her solve the following problem.The first line of the input contains a single integer N.
The second line of input contains N space-separated integers, the integers of the array A.

Constraints
1 <= N <= 200000
0 <= A[i] <= 200000Output N integers, the answers for each index <b>i</b> in a new line.Sample Input
4
1 1 0 2

Sample Output
0
0
2
3

Explanation:
For i=1, subarray = [1], smallest non negative missing integer = 0.
For i=2, subarray = [1, 1], smallest non negative missing integer = 0.
For i=3, subarray = [1, 1, 0], smallest non negative missing integer = 2.
For i=4, subarray = [1, 1, 0, 2], smallest non negative missing integer = 3.

Sample Input
10
5 4 3 2 1 0 7 7 6 6

Sample Output
0
0
0
0
0
6
6
6
8
8, I have written this Solution Code: def mis(arr, N):
    m = 0
    c = [0] * (N + 1)
    for i in range(N):
        if (arr[i] >= 0 and arr[i] < N):
            c[arr[i]] = True
        while (c[m]):
            m += 1
        print(m)
if __name__ == '__main__':
    N = int(input())
    arr = list(map(int,input().split()))         
    mis(arr, N), In this Programming Language: Python, Now tell me if this Code is compilable or not?