



from __future__ import annotations


def 						_UpperCAmelCase							( snake_case     ):





					"""simple docstring"""

					_lowerCAmelCase         =       {1}
					_lowerCAmelCase         =       [1]
					for _ in range(2      ,		depth + 1     ):
										_lowerCAmelCase         =       [*previous_coefficients, 0]
										_lowerCAmelCase         =       [0, *previous_coefficients]
										_lowerCAmelCase         =       []
										for x, y in zip(snake_case      ,		snake_case     ):
															coefficients.add(x + y     )
															previous_coefficients.append(x + y     )
					return coefficients


def 						_UpperCAmelCase							( snake_case     ):





					"""simple docstring"""

					_lowerCAmelCase         =       set()
					for number in unique_coefficients:
										_lowerCAmelCase         =       2
										_lowerCAmelCase         =       number
										while divisor**2 <= copy_number:
															_lowerCAmelCase         =       0
															while copy_number % divisor == 0:
																				copy_number //= divisor
																				multiplicity += 1
															if multiplicity >= 2:
																				non_squarefrees.add(snake_case     )
																				break
															divisor += 1

					return unique_coefficients.difference(snake_case     )


def 						_UpperCAmelCase							( snake_case = 51     ):





					"""simple docstring"""

					_lowerCAmelCase         =       get_pascal_triangle_unique_coefficients(snake_case     )
					_lowerCAmelCase         =       get_squarefrees(snake_case     )
					return sum(snake_case     )


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







"""simple docstring"""







from __future__ import annotations






def        a__			(							_UpperCamelCase			):





						"""simple docstring"""

						UpperCAmelCase__												=     sorted(_UpperCamelCase			)
						UpperCAmelCase__												=     len(_UpperCamelCase			)
						UpperCAmelCase__												=     length >> 1
						return (
						    (sorted_list[mid_index] + sorted_list[mid_index - 1]) / 2
						    if length % 2 == 0
						    else sorted_list[mid_index]
						)






def        a__			(							):





						"""simple docstring"""

						import doctest

						doctest.testmod()


if __name__ == "__main__":
						main()