




def 			lowerCamelCase_		(       UpperCamelCase__				:      list      )     ->       list:





				"""simple docstring"""


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

				__lowerCamelCase		       =    []

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

								generate(k - 1 ,     UpperCamelCase__      )

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

				generate(len(UpperCamelCase__      ) ,     UpperCamelCase__      )
				return res


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






'''simple docstring'''






def 				UpperCamelCase_			(    A__					:   int					):
  '''simple docstring'''





  lowerCAmelCase_			:      Union[str, Any]			=   (1 + 24 * n) ** 0.5
  return ((1 + root) / 6) % 1 == 0







def 				UpperCamelCase_			(    A__					:   int = 50_00					):
  '''simple docstring'''





  lowerCAmelCase_			:      Optional[int]			=   [(i * (3 * i - 1)) // 2 for i in range(1							,    A__					)]
  for i, pentagonal_i in enumerate(A__					):
    for j in range(A__							,    len(A__					)					):
      lowerCAmelCase_			:      int			=   pentagonal_nums[j]
      lowerCAmelCase_			:      Union[str, Any]			=   pentagonal_i + pentagonal_j
      lowerCAmelCase_			:      List[Any]			=   pentagonal_j - pentagonal_i
      if is_pentagonal(A__					) and is_pentagonal(A__					):
        return b

  return -1


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



