



'''simple docstring'''





from __future__ import annotations

import random


class 							_lowerCAmelCase	:


 """simple docstring"""

 lowerCamelCase									=     6







 def __init__(      self  )    ->    Any:
    A_  :		List[Any]						=					list(range(1					,    Dice.NUM_SIDES + 1  )  )







 def       UpperCAmelCase_       (      self  )    ->    List[Any]:
    return random.choice(self.sides  )



def     UpperCAmelCase     (    a_      ,		a_ = 2		)   ->       list[float]:



   """simple docstring"""






   A_  :		Dict						=					[Dice() for i in range(a_		)]
   A_  :		Tuple						=					[0] * (len(a_		) * Dice.NUM_SIDES + 1)
   for _ in range(a_		):
      count_of_sum[sum(dice.roll() for dice in dices		)] += 1
   A_  :		Union[str, Any]						=					[round((count * 1_0_0) / 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()





'''simple docstring'''





def     UpperCAmelCase     (    a_ = 9_9_8_0_0_1		)   ->       int:



   """simple docstring"""






   for number in range(n - 1      ,		9_9_9_9      ,		-1		):
      A_  :		Optional[Any]						=					str(a_		)

      # checks whether 'str_number' is a palindrome.
      if str_number == str_number[::-1]:
         A_  :		int						=					9_9_9

         # if 'number' is a product of two 3-digit numbers
         # then number is the answer otherwise fetch next number.
         while divisor != 9_9:
            if (number % divisor == 0) and (len(str(number // divisor		)		) == 3.0):
               return number
            divisor -= 1
   raise ValueError("""That number is larger than our acceptable range."""		)


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