





def lowerCAmelCase__(__snake_case							)				->      List[Any]:







	'''simple docstring'''







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

	lowerCamelCase__								=		[]

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

		generate(k - 1       ,_A							)

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

	generate(len(_A							)       ,_A							)
	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))







class 			_lowercase :  # Public class to implement a graph


       """simple docstring"""




       def __init__(   self							:			Dict					,      __lowerCamelCase							:			int					,      __lowerCamelCase							:			int					,      __lowerCamelCase							:			list[list[bool]]       ):


             '''simple docstring'''



             lowerCamelCase__		:				int    =  row
             lowerCamelCase__		:				Optional[Any]    =  col
             lowerCamelCase__		:				Union[str, Any]    =  graph





       def 						lowerCAmelCase     (   self							:			Optional[int]					,      __lowerCamelCase							:			int					,      __lowerCamelCase							:			int					,      __lowerCamelCase							:			list[list[bool]]       ):


             '''simple docstring'''



             return (
                 0 <= i < self.ROW
                 and 0 <= j < self.COL
                 and not visited[i][j]
                 and self.graph[i][j]
             )





       def 						lowerCAmelCase     (   self							:			Dict					,      __lowerCamelCase							:			int					,      __lowerCamelCase							:			int					,      __lowerCamelCase							:			list[list[bool]]       ):


             '''simple docstring'''



             lowerCamelCase__		:				str    =  [-1, -1, -1, 0, 0, 1, 1, 1]  # Coordinate order
             lowerCamelCase__		:				Tuple    =  [-1, 0, 1, -1, 1, -1, 0, 1]
             lowerCamelCase__		:				List[Any]    =  True  # Make those cells visited
             for k in range(8       ):
                   if self.is_safe(i + row_nbr[k]					,      j + col_nbr[k]					,      __lowerCamelCase       ):
                         self.diffs(i + row_nbr[k]					,      j + col_nbr[k]					,      __lowerCamelCase       )





       def 						lowerCAmelCase     (   self							:			List[Any]       ):  # And finally, count all islands.


             '''simple docstring'''



             lowerCamelCase__		:				List[Any]    =  [[False for j in range(self.COL       )] for i in range(self.ROW       )]
             lowerCamelCase__		:				Optional[Any]    =  0
             for i in range(self.ROW       ):
                   for j in range(self.COL       ):
                         if visited[i][j] is False and self.graph[i][j] == 1:
                               self.diffs(__lowerCamelCase					,      __lowerCamelCase					,      __lowerCamelCase       )
                               count += 1
             return count


