




import math

_UpperCAmelCase	:						Optional[Any]			=     10
_UpperCAmelCase	:						int			=     7
_UpperCAmelCase	:						int			=     BALLS_PER_COLOUR * NUM_COLOURS



def       UpperCAmelCase__  (     lowerCamelCase = 20   ):
  lowercase    :str      	=						math.comb(lowerCamelCase,			lowerCamelCase   )
  lowercase    :Dict      	=						math.comb(NUM_BALLS - BALLS_PER_COLOUR,			lowerCamelCase   )

  lowercase    :List[str]      	=						NUM_COLOURS * (1 - missing_colour / total)

  return F"{result:.9f}"


if __name__ == "__main__":
   print(solution(20))









def       UpperCAmelCase__  (     lowerCamelCase   ):
  if divisor % 5 == 0 or divisor % 2 == 0:
    return 0
  lowercase    :str      	=						1
  lowercase    :Tuple      	=						1
  while repunit:
    lowercase    :Dict      	=						(10 * repunit + 1) % divisor
    repunit_index += 1
  return repunit_index



def       UpperCAmelCase__  (     lowerCamelCase = 1000000   ):
  lowercase    :List[Any]      	=						limit - 1
  if divisor % 2 == 0:
    divisor += 1
  while least_divisible_repunit(lowerCamelCase   ) <= limit:
    divisor += 2
  return divisor


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



