






'''simple docstring'''







def       __UpperCamelCase					(      lowercase_       :  list   ):
       """simple docstring"""




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

       a_						     =			[]

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

              generate(k - 1   ,       lowercase_   )

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

       generate(len(lowercase_   )   ,       lowercase_   )
       return res


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












'''simple docstring'''







from math import isqrt, loga


def       __UpperCamelCase					(      lowercase_       :  int   ):
       """simple docstring"""




       a_						     =			[True] * max_number
       for i in range(2   ,       isqrt(max_number - 1   ) + 1   ):
              if is_prime[i]:
                     for j in range(i**2   ,       lowercase_   ,       lowercase_   ):
                            a_						     =			False

       return [i for i in range(2   ,       lowercase_   ) if is_prime[i]]


def       __UpperCamelCase					(      lowercase_       :  int = 800_800   ,       lowercase_       :  int = 800_800   ):
       """simple docstring"""




       a_						     =			degree * loga(lowercase_   )
       a_						     =			int(lowercase_   )
       a_						     =			calculate_prime_numbers(lowercase_   )

       a_						     =			0
       a_						     =			0
       a_						     =			len(lowercase_   ) - 1
       while left < right:
              while (
                  prime_numbers[right] * loga(prime_numbers[left]   )
                  + prime_numbers[left] * loga(prime_numbers[right]   )
                  > upper_bound
              ):
                     right -= 1
              hybrid_integers_count += right - left
              left += 1

       return hybrid_integers_count


if __name__ == "__main__":
  print(f"""{solution() = }""")




