


'''simple docstring'''





def     UpperCamelCase    (      _a		)					->							float:
     '''simple docstring'''





     lowercase_       :List[str]     =       0
     while len(_a		) > 1:
          lowercase_       :Dict     =       0
          # Consider two files with minimum cost to be merged
          for _ in range(2		):
               lowercase_       :List[str]     =       files.index(min(_a		)		)
               temp += files[min_index]
               files.pop(_a		)
          files.append(_a		)
          optimal_merge_cost += temp
     return optimal_merge_cost


if __name__ == "__main__":
   import doctest

   doctest.testmod()





import math

SCREAMING_SNAKE_CASE       :		List[str]         =				10
SCREAMING_SNAKE_CASE       :		Dict         =				7
SCREAMING_SNAKE_CASE       :		int         =				BALLS_PER_COLOUR * NUM_COLOURS




def     UpperCamelCase    (      _a = 2_0		)					->							str:
     '''simple docstring'''





     lowercase_       :List[str]     =       math.comb(_a       ,		_a		)
     lowercase_       :Tuple     =       math.comb(NUM_BALLS - BALLS_PER_COLOUR       ,		_a		)

     lowercase_       :Dict     =       NUM_COLOURS * (1 - missing_colour / total)

     return f"{result:.9f}"


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

