


def 				__lowerCamelCase						( UpperCAmelCase_						:		list						):




      """simple docstring"""





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

      a						:Tuple 							=       []

      def generate(UpperCAmelCase_						:		int ,  UpperCAmelCase_						:		list						):
            a						:str 							=       [0] * n
            res.append(tuple(UpperCAmelCase_						)						)

            a						:Optional[Any] 							=       0
            while i < n:
                  if c[i] < i:
                        if i % 2 == 0:
                              a							,				a						:str 							=       arr[i], arr[0]
                        else:
                              a							,				a						:List[str] 							=       arr[i], arr[c[i]]
                        res.append(tuple(UpperCAmelCase_						)						)
                        c[i] += 1
                        a						:int 							=       0
                  else:
                        a						:List[str] 							=       0
                        i += 1

      generate(len(UpperCAmelCase_						) ,  UpperCAmelCase_						)
      return res


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









def 				__lowerCamelCase						( UpperCAmelCase_						:		int = 1000						):




      """simple docstring"""





      a							,				a						:int 							=       1, 1
      a						:Any 							=       2
      while True:
            a						:Optional[int] 							=       0
            a						:str 							=       fa + fa
            a							,				a						:List[Any] 							=       fa, f
            index += 1
            for _ in str(UpperCAmelCase_						):
                  i += 1
            if i == n:
                  break
      return index


if __name__ == "__main__":
     print(solution(int(str(input()).strip())))





