def search(arr, n):
    if n == 0:
        return None
    if n == 1:
        return arr[0]

    low, high = 0, n - 1
    while low < high:
        mid = (low + high) // 2
        if mid % 2 == 1:
            mid -= 1
        if arr[mid] == arr[mid + 1]:
            low = mid + 2
        else:
            high = mid
    return arr[low]