```python
def first_Missing_Positive(arr, n):
    """
    Finds the first missing positive integer in an array.

    Args:
        arr: A list of integers.
        n: The number of elements in the list.

    Returns:
        The smallest positive integer not present in the array.
    """
    # Create a set of the numbers present in the array for efficient lookups.
    present_numbers = set(arr)

    # The first missing positive must be in the range [1, n + 1].
    # For example, if arr is [1, 2, ..., n], the answer is n + 1.
    # We check numbers from 1 upwards.
    for candidate in range(1, n + 2):
        if candidate not in present_numbers:
            # This is the first positive integer we've found that's not in the array.
            return candidate
```