





def 							SCREAMING_SNAKE_CASE__       (  snake_case__  :list     )      ->						list:

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

  _lowercase							= []

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

    generate(k - 1			,							snake_case__     )

    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			,							snake_case__     )

  generate(len(snake_case__     )			,							snake_case__     )
  return res


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






from __future__ import annotations

from collections.abc import Generator

def 							SCREAMING_SNAKE_CASE__       (  )      ->						Generator[int, None, None]:
  _lowercase							= {}
  _lowercase							= 2
  while True:
    _lowercase							= factor_map.pop(snake_case__			,							snake_case__     )
    if factor:
      _lowercase							= factor + prime
      while x in factor_map:
        x += factor
      _lowercase							= factor
    else:
      _lowercase							= prime
      yield prime
    prime += 1

def 							SCREAMING_SNAKE_CASE__       (  snake_case__  :float = 1E10     )      ->						int:
  _lowercase							= sieve()

  _lowercase							= 1
  while True:
    _lowercase							= next(snake_case__     )
    if (2 * prime * n) > limit:
      return n
    # Ignore the next prime as the reminder will be 2.
    next(snake_case__     )
    n += 2


if __name__ == "__main__":
      print(solution())