

def      snake_case_				(__A					:						list					)      ->     list:

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

   __lowerCAmelCase  :      Union[str, Any]    =						[]

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

      generate(k - 1 ,       _lowerCamelCase					)

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

   generate(len(_lowerCamelCase					) ,       _lowerCamelCase					)
   return res


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





def      snake_case_				()      ->     List[Any]:
   for n in range(1 ,       1_0_0_0_0_0_0					):
      yield n * (n + 1) // 2





def      snake_case_				(__A					:						Dict					)      ->     Tuple:
   __lowerCAmelCase  :      Optional[int]    =						1
   __lowerCAmelCase  :      Optional[int]    =						2
   while i * i <= n:
      __lowerCAmelCase  :      Optional[int]    =						0
      while n % i == 0:
         n //= i
         multiplicity += 1
      divisors_count *= multiplicity + 1
      i += 1
   if n > 1:
      divisors_count *= 2
   return divisors_count





def      snake_case_				()      ->     Dict:
   return next(i for i in triangle_number_generator() if count_divisors(__A					) > 5_0_0					)


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


