def smallest_missing(A, left_element, right_element):
    if left_element > right_element:
        return left_element
    
    mid = (left_element + right_element) // 2
    
    if A[mid] == mid:
        return smallest_missing(A, mid + 1, right_element)
    else:
        return smallest_missing(A, left_element, mid - 1)