def max_Product(arr):
    if len(arr) < 2:
        return None
    
    arr_sorted = sorted(arr)
    
    # Candidates: two largest or two most negative (smallest)
    candidate1 = arr_sorted[-1] * arr_sorted[-2]
    candidate2 = arr_sorted[0] * arr_sorted[1]
    
    if candidate1 >= candidate2:
        return (arr_sorted[-2], arr_sorted[-1])
    else:
        return (arr_sorted[0], arr_sorted[1])