






def   _A       (    SCREAMING_SNAKE_CASE__  :     list[int]	):
    # base case
    if len(SCREAMING_SNAKE_CASE__	) == 1:
        return a[0], a[0]
    else:
        # split A into half.
        UpperCamelCase	:Optional[int]     							=       a[: len(SCREAMING_SNAKE_CASE__	) // 2]
        UpperCamelCase	:Union[str, Any]     							=       a[len(SCREAMING_SNAKE_CASE__	) // 2 :]

        # 2 sub problems, 1/2 of original size.
        UpperCamelCase							,       UpperCamelCase	:Dict     							=       max_difference(SCREAMING_SNAKE_CASE__	)
        UpperCamelCase							,       UpperCamelCase	:Any     							=       max_difference(SCREAMING_SNAKE_CASE__	)

        # get min of first and max of second
        # linear time
        UpperCamelCase	:Optional[Any]     							=       min(SCREAMING_SNAKE_CASE__	)
        UpperCamelCase	:int     							=       max(SCREAMING_SNAKE_CASE__	)

        # 3 cases, either (small1, big1),
        # (min_first, max_second), (small2, big2)
        # constant comparisons
        if biga - smalla > max_second - min_first and biga - smalla > biga - smalla:
            return smalla, biga
        elif biga - smalla > max_second - min_first:
            return smalla, biga
        else:
            return min_first, max_second


if __name__ == "__main__":
 import doctest

 doctest.testmod()













def   _A       (    SCREAMING_SNAKE_CASE__  :     float					,  SCREAMING_SNAKE_CASE__  :     float	):
    UpperCamelCase	:Tuple     							=       float()
    try:
        UpperCamelCase	:Union[str, Any]     							=       mass * acceleration
    except Exception:
        return -0.0
    return force


if __name__ == "__main__":
 import doctest

 # run doctest
 doctest.testmod()

 # demo
 __snake_case							 =  1_2.5
 __snake_case							 =  10
 __snake_case							 =  newtons_second_law_of_motion(mass, acceleration)
 print("""The force is """, force, """N""")





