def max_pairwise_product_take_two(numbers):
    """Finds the maximum pairwise product in te numbers
    
    Args:
     numbers (list): non-negative integers

    Returns:
     int: largest possible product from the numbers
    """    
    first_index = 0
    first_value = 0
    n = len(numbers)
    assert n >= 2
    for index in range(1, n):
        if numbers[index] > first_value:
            first_value = numbers[index]
            first_index = index

    second_value = 0
    start = 1 if first_index == 0 else 0
    for index in range(start, n):
        if index != first_index and numbers[index] > second_value:
            second_value = numbers[index]
    return first_value * second_value