




'''simple docstring'''





import math

_SCREAMING_SNAKE_CASE							:       List[str]						=			10
_SCREAMING_SNAKE_CASE							:       Optional[int]						=			7
_SCREAMING_SNAKE_CASE							:       int						=			BALLS_PER_COLOUR * NUM_COLOURS


def 					UpperCamelCase_(     snake_case							:	Optional[Any] = 2_0					):

							'''simple docstring'''






							snake_case_      =				math.comb(a__							,    a__					)
							snake_case_      =				math.comb(NUM_BALLS - BALLS_PER_COLOUR							,    a__					)

							snake_case_      =				NUM_COLOURS * (1 - missing_colour / total)

							return f'{result:.9f}'


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












'''simple docstring'''





def 					UpperCamelCase_(     snake_case							:	int							,    snake_case							:	int					):

							'''simple docstring'''






							while b:
														snake_case_ ,				snake_case_      =				b, a % b
							return a


def 					UpperCamelCase_(     snake_case							:	int							,    snake_case							:	int					):

							'''simple docstring'''






							return a if b == 0 else euclidean_gcd_recursive(snake_case							,    a % b					)


def 					UpperCamelCase_(     ):

							'''simple docstring'''






							print(f'euclidean_gcd(3, 5) = {euclidean_gcd(3							,    5					)}'					)
							print(f'euclidean_gcd(5, 3) = {euclidean_gcd(5							,    3					)}'					)
							print(f'euclidean_gcd(1, 3) = {euclidean_gcd(1							,    3					)}'					)
							print(f'euclidean_gcd(3, 6) = {euclidean_gcd(3							,    6					)}'					)
							print(f'euclidean_gcd(6, 3) = {euclidean_gcd(6							,    3					)}'					)

							print(f'euclidean_gcd_recursive(3, 5) = {euclidean_gcd_recursive(3							,    5					)}'					)
							print(f'euclidean_gcd_recursive(5, 3) = {euclidean_gcd_recursive(5							,    3					)}'					)
							print(f'euclidean_gcd_recursive(1, 3) = {euclidean_gcd_recursive(1							,    3					)}'					)
							print(f'euclidean_gcd_recursive(3, 6) = {euclidean_gcd_recursive(3							,    6					)}'					)
							print(f'euclidean_gcd_recursive(6, 3) = {euclidean_gcd_recursive(6							,    3					)}'					)


if __name__ == "__main__":
		main()




