

"""simple docstring"""




def 	UpperCAmelCase__   (				A__   )      ->      list:




   """simple docstring"""

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

   lowerCamelCase__						=			[]

   def generate(A__	,    A__   ):
      lowerCamelCase__						=			[0] * n
      res.append(tuple(_A   )   )

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

   generate(len(_A   )	,    _A   )
   return res


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







"""simple docstring"""




import operator as op



def 	UpperCAmelCase__   (				A__   )      ->      Dict:




   """simple docstring"""
   lowerCamelCase__						=			[]
   lowerCamelCase__						=			lambda A__	,    A__   : int(x / y   )  # noqa: E731 integer division operation
   lowerCamelCase__						=			{
       "^": op.pow,
       "*": op.mul,
       "/": div,
       "+": op.add,
       "-": op.sub,
   }  # operators & their respective operation

   # print table header
   print("Symbol".center(8   )	,    "Action".center(12   )	,    "Stack"	,    sep=" | "   )
   print("-" * (30 + len(A__   ))   )

   for x in post_fix:
      if x.isdigit():  # if x in digit
         stack.append(A__   )  # append x to stack
         # output in tabular format
         print(x.rjust(8   )	,    ("push(" + x + ")").ljust(12   )	,    ",".join(A__   )	,    sep=" | "   )
      else:
         lowerCamelCase__						=			stack.pop()  # pop stack
         # output in tabular format
         print("".rjust(8   )	,    ("pop(" + b + ")").ljust(12   )	,    ",".join(A__   )	,    sep=" | "   )

         lowerCamelCase__						=			stack.pop()  # pop stack
         # output in tabular format
         print("".rjust(8   )	,    ("pop(" + a + ")").ljust(12   )	,    ",".join(A__   )	,    sep=" | "   )

         stack.append(
             str(opr[x](int(A__   )	,    int(A__   )   )   )   )  # evaluate the 2 values popped from stack & push result to stack
         # output in tabular format
         print(
             x.rjust(8   )	,    ("push(" + a + x + b + ")").ljust(12   )	,    ",".join(A__   )	,    sep=" | "	,    )

   return int(stack[0]   )


if __name__ == "__main__":
     SCREAMING_SNAKE_CASE_     :			Tuple	  =			input('''\n\nEnter a Postfix Equation (space separated) = ''').split(''' ''')
     print('''\n\tResult = ''', solve(Postfix))




