






'''simple docstring'''







def  SCREAMING_SNAKE_CASE_       (UpperCamelCase      )      ->       list:

							if len(UpperCamelCase      ) <= 1:
														return [tuple(UpperCamelCase      )]

							lowerCamelCase__					:	Union[str, Any]         =       []

							def generate(UpperCamelCase				,			UpperCamelCase      ):
														lowerCamelCase__					:	List[str]         =       [0] * n
														res.append(tuple(UpperCamelCase      )      )

														lowerCamelCase__					:	str         =       0
														while i < n:
																					if c[i] < i:
																												if i % 2 == 0:
																																			lowerCamelCase__  ,		lowerCamelCase__					:	Dict         =       arr[i], arr[0]
																												else:
																																			lowerCamelCase__  ,		lowerCamelCase__					:	Dict         =       arr[i], arr[c[i]]
																												res.append(tuple(UpperCamelCase      )      )
																												c[i] += 1
																												lowerCamelCase__					:	Optional[int]         =       0
																					else:
																												lowerCamelCase__					:	Dict         =       0
																												i += 1

							generate(len(UpperCamelCase      )				,			UpperCamelCase      )
							return res


if __name__ == "__main__":
			_A	:			str         =input('''Enter numbers separated by a comma:\n''').strip()
			_A	:			Optional[int]         =[int(item) for item in user_input.split(''',''')]
			print(heaps(arr))









'''simple docstring'''







def  SCREAMING_SNAKE_CASE_       (UpperCamelCase = 1000      )      ->       int:
							lowerCamelCase__					:	str         =       -1
							lowerCamelCase__					:	Dict         =       0
							for a in range(1				,			n // 3      ):
														# Solving the two equations a**2+b**2=c**2 and a+b+c=N eliminating c
														lowerCamelCase__					:	Dict         =       (n * n - 2 * a * n) // (2 * n - 2 * a)
														lowerCamelCase__					:	Any         =       n - a - b
														if c * c == (a * a + b * b):
																					lowerCamelCase__					:	Dict         =       a * b * c
																					if candidate >= product:
																												lowerCamelCase__					:	Union[str, Any]         =       candidate
							return product


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

