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


if __name__ == "__main__":
   import doctest

   # run doctest
   doctest.testmod()

   # demo
   __lowerCamelCase							= 12.5
   __lowerCamelCase							= 10
   __lowerCamelCase							= newtons_second_law_of_motion(mass, acceleration)
   print("""The force is """, force, """N""")







def     UpperCamelCase      (					__lowerCamelCase  :				int = 998001					):
       snake_case :     Optional[Any]           =   0
       for i in range(999       ,      99       ,      -1					):  # 3 digit numbers range from 999 down to 100
              for j in range(999       ,      99       ,      -1					):
                     snake_case :     Tuple           =   str(i * j					)
                     if product_string == product_string[::-1] and i * j < n:
                            snake_case :     str           =   max(__lowerCamelCase       ,      i * j					)
       return answer


if __name__ == "__main__":
   print(F'{solution() = }')





