



def  UpperCAmelCase__    (    lowercase__   ) ->      list:

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

						__lowercase					=				[]

						def generate(lowercase__						,       lowercase__   ):
												if k == 1:
																		res.append(tuple(arr[:]   )   )
																		return

												generate(k - 1						,       lowercase__   )

												for i in range(k - 1   ):
																		if k % 2 == 0:  # k is even
																								__lowercase	,			__lowercase					=				arr[k - 1], arr[i]
																		else:  # k is odd
																								__lowercase	,			__lowercase					=				arr[k - 1], arr[0]
																		generate(k - 1						,       lowercase__   )

						generate(len(lowercase__   )						,       lowercase__   )
						return res


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










def  UpperCAmelCase__    (    lowercase__ = 100   ) ->      int:
						__lowercase					=				n * (n + 1) * (2 * n + 1) / 6
						__lowercase					=				(n * (n + 1) / 2) ** 2
						return int(square_of_sum - sum_of_squares   )


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





