





'''simple docstring'''



from __future__ import annotations

# Define the Gravitational Constant G and the function
snake_case_   :  List[Any]								=      6.67_43e-11  # unit of G : m^3 * kg^-1 * s^-2



def  lowercase__(		_UpperCamelCase  : float ,   _UpperCamelCase  : float ,   _UpperCamelCase  : float ,   _UpperCamelCase  : float				)->   dict[str, float]:






					"""simple docstring"""

					_UpperCamelCase											=   mass_a * mass_a

					if (force, mass_a, mass_a, distance).count(0				) != 1:
										raise ValueError("One and only one argument must be 0"				)
					if force < 0:
										raise ValueError("Gravitational force can not be negative"				)
					if distance < 0:
										raise ValueError("Distance can not be negative"				)
					if mass_a < 0 or mass_a < 0:
										raise ValueError("Mass can not be negative"				)
					if force == 0:
										_UpperCamelCase											=   GRAVITATIONAL_CONSTANT * product_of_mass / (distance**2)
										return {"force": force}
					elif mass_a == 0:
										_UpperCamelCase											=   (force) * (distance**2) / (GRAVITATIONAL_CONSTANT * mass_a)
										return {"mass_1": mass_a}
					elif mass_a == 0:
										_UpperCamelCase											=   (force) * (distance**2) / (GRAVITATIONAL_CONSTANT * mass_a)
										return {"mass_2": mass_a}
					elif distance == 0:
										_UpperCamelCase											=   (GRAVITATIONAL_CONSTANT * product_of_mass / (force)) ** 0.5
										return {"distance": distance}
					raise ValueError("One and only one argument must be 0"				)


# Run doctest
if __name__ == "__main__":
			import doctest

			doctest.testmod()










'''simple docstring'''



from __future__ import annotations



def  lowercase__(		_UpperCamelCase  : list[int]				)->   list[int]:






					"""simple docstring"""

					if not list_of_ints:
										return []

					if min(_UpperCamelCase				) < 0:
										raise ValueError("All numbers must be positive"				)

					_UpperCamelCase											=   max(len(bin(_UpperCamelCase				)[2:]				) for x in list_of_ints				)
					return _msd_radix_sort(_UpperCamelCase ,   _UpperCamelCase				)



def  lowercase__(		_UpperCamelCase  : list[int] ,   _UpperCamelCase  : int				)->   list[int]:






					"""simple docstring"""

					if bit_position == 0 or len(_UpperCamelCase				) in [0, 1]:
										return list_of_ints

					_UpperCamelCase											=   []
					_UpperCamelCase											=   []
					# Split numbers based on bit at bit_position from the right
					for number in list_of_ints:
										if (number >> (bit_position - 1)) & 1:
															# number has a one at bit bit_position
															ones.append(_UpperCamelCase				)
										else:
															# number has a zero at bit bit_position
															zeros.append(_UpperCamelCase				)

    # recursively split both lists further
					_UpperCamelCase											=   _msd_radix_sort(_UpperCamelCase ,   bit_position - 1				)
					_UpperCamelCase											=   _msd_radix_sort(_UpperCamelCase ,   bit_position - 1				)

					# recombine lists
					_UpperCamelCase											=   zeros
					res.extend(_UpperCamelCase				)

					return res



def  lowercase__(		_UpperCamelCase  : list[int]				)->   Union[str, Any]:






					"""simple docstring"""

					_UpperCamelCase											=   len(_UpperCamelCase				)
					if not list_of_ints or length == 1:
										return

					if min(_UpperCamelCase				) < 0:
										raise ValueError("All numbers must be positive"				)

					_UpperCamelCase											=   max(len(bin(_UpperCamelCase				)[2:]				) for x in list_of_ints				)
					_msd_radix_sort_inplace(_UpperCamelCase ,   _UpperCamelCase ,   0 ,   _UpperCamelCase				)



def  lowercase__(		_UpperCamelCase  : list[int] ,   _UpperCamelCase  : int ,   _UpperCamelCase  : int ,   _UpperCamelCase  : int				)->   Tuple:






					"""simple docstring"""

					if bit_position == 0 or end_index - begin_index <= 1:
										return

					bit_position -= 1

					_UpperCamelCase											=   begin_index
					_UpperCamelCase											=   end_index - 1
					while i <= j:
										_UpperCamelCase											=   False
										if not (list_of_ints[i] >> bit_position) & 1:
															# found zero at the beginning
															i += 1
															_UpperCamelCase											=   True
										if (list_of_ints[j] >> bit_position) & 1:
															# found one at the end
															j -= 1
															_UpperCamelCase											=   True

										if changed:
															continue

										_UpperCamelCase				,	_UpperCamelCase											=   list_of_ints[j], list_of_ints[i]
										j -= 1
										if j != i:
															i += 1

					_msd_radix_sort_inplace(_UpperCamelCase ,   _UpperCamelCase ,   _UpperCamelCase ,   _UpperCamelCase				)
					_msd_radix_sort_inplace(_UpperCamelCase ,   _UpperCamelCase ,   _UpperCamelCase ,   _UpperCamelCase				)


if __name__ == "__main__":
			import doctest

			doctest.testmod()



