code: '''simple docstring'''
  
  
  
  
  
  from __future__ import annotations
  
  # Define the Gravitational Constant G and the function
  A           =   6.6_7_4_3e-1_1  # unit of G : m^3 * kg^-1 * s^-2
  def   snake_case_       (							_a     :							Any ,					_a     :							Optional[Any] ,					_a     :							int ,					_a     :							Any			):
        snake_case_						       =							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:
              snake_case_						       =							GRAVITATIONAL_CONSTANT * product_of_mass / (distance**2)
              return {"force": force}
        elif mass_a == 0:
              snake_case_						       =							(force) * (distance**2) / (GRAVITATIONAL_CONSTANT * mass_a)
              return {"mass_1": mass_a}
        elif mass_a == 0:
              snake_case_						       =							(force) * (distance**2) / (GRAVITATIONAL_CONSTANT * mass_a)
              return {"mass_2": mass_a}
        elif distance == 0:
              snake_case_						       =							(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()
  
  
style_context: 
  '''simple docstring'''
  
  
  
  
  
  from __future__ import annotations
  
  import random
  
  
  
  class  lowerCAmelCase__   :
  
  
  
    '''simple docstring'''
  
  
  
  
  
  
    _UpperCamelCase						= 6
  
    def __init__(self  : List[Any]    )   ->       Optional[Any]:
          snake_case_						       =							list(range(1	, Dice.NUM_SIDES + 1    )    )
  
  
    def 		_lowerCamelCase	(self  : Optional[int]    )   ->       int:
          return random.choice(self.sides    )
  
  def   snake_case_       (							_a     :							int ,					_a     :							int = 2			):
        snake_case_						       =							[Dice() for i in range(_a			)]
        snake_case_						       =							[0] * (len(_a			) * Dice.NUM_SIDES + 1)
        for _ in range(_a			):
              count_of_sum[sum(dice.roll() for dice in dices			)] += 1
        snake_case_						       =							[round((count * 100) / num_throws ,					2			) for count in count_of_sum]
        return probability[num_dice:]  # remove probability of sums that never appear
  
  
  if __name__ == "__main__":
       import doctest
  
       doctest.testmod()
  
  