def max_Product(arr):
    if len(arr) < 2:
        return None
    arr_sorted = sorted(arr)
    n = len(arr_sorted)
    # Compare product of two largest vs two smallest (most negative)
    prod1 = arr_sorted[n-1] * arr_sorted[n-2]
    prod2 = arr_sorted[0] * arr_sorted[1]
    if prod1 >= prod2:
        return (arr_sorted[n-2], arr_sorted[n-1])
    else:
        return (arr_sorted[0], arr_sorted[1])