



import math
def 	lowercase_							(A			:			int				):

       if 1 < number < 4:
              # 2 and 3 are primes
              return True
       elif number < 2 or number % 2 == 0 or number % 3 == 0:
              # Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
              return False

       # All primes number are in format of 6k +/- 1
       for i in range(5		, int(math.sqrt(A				) + 1				)		, 6				):
              if number % i == 0 or number % (i + 2) == 0:
                     return False
       return True
def 	lowercase_							(A			:			int = 1_0_0_0		, A			:			int = 1_0_0_0				):
       snake_case__							:     str            =     [0, 0, 0]  # length, a, b
       for a in range((a_limit * -1) + 1		, A				):
              for b in range(2		, A				):
                     if is_prime(A				):
                            snake_case__							:     Optional[Any]            =     0
                            snake_case__							:     Optional[int]            =     0
                            while is_prime((n**2) + (a * n) + b				):
                                   count += 1
                                   n += 1
                            if count > longest[0]:
                                   snake_case__							:     Union[str, Any]            =     [count, a, b]
       snake_case__							:     List[str]            =     longest[1] * longest[2]
       return ans


if __name__ == "__main__":
 print(solution(1_000, 1_000))











def 	lowercase_							(A			:			Dict				):
       snake_case__							:     Optional[int]            =     len(A				)
       for i in range(length - 1				):
              snake_case__							:     List[str]            =     False
              for j in range(length - 1 - i				):
                     if collection[j] > collection[j + 1]:
                            snake_case__							:     Optional[Any]            =     True
                            snake_case__     ,    snake_case__							:     Dict            =     collection[j + 1], collection[j]
              if not swapped:
                     break  # Stop iteration if the collection is sorted.
       return collection


if __name__ == "__main__":
 import doctest
 import time

 doctest.testmod()

 a_       :Any				  =				input("Enter numbers separated by a comma:").strip()
 a_       :Optional[Any]				  =				[int(item) for item in user_input.split(",")]
 a_       :Optional[int]				  =				time.process_time()
 print(*bubble_sort(unsorted), sep=",")
 print(F"""Processing time: {(time.process_time() - start)%1e9 + 7}""")






