
import math

def a__   (	A_ ):






  '''simple docstring'''





  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 a__   (	A_ = 1000,					A_ = 1000 ):






  '''simple docstring'''





  __magic_name__    					=	[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_ ):
        __magic_name__    					=	0
        __magic_name__    					=	0
        while is_prime((n**2) + (a * n) + b ):
          count += 1
          n += 1
        if count > longest[0]:
          __magic_name__    					=	[count, a, b]
  __magic_name__    					=	longest[1] * longest[2]
  return ans


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



from itertools import compress, repeat
from math import ceil, sqrt

def a__   (	A_ ):






  '''simple docstring'''





  if num <= 2:
    return []
  if num == 3:
    return [2]

  # Odd sieve for numbers in range [3, num - 1]
  __magic_name__    					=	bytearray(b"""\x01""" ) * ((num >> 1) - 1)

  for i in range(3,					int(sqrt(A_ ) ) + 1,					2 ):
    if sieve[(i >> 1) - 1]:
      __magic_name__    					=	i**2
      __magic_name__    					=	repeat(
          0,					ceil((num - i_squared) / (i << 1) ) )

  return [2] + list(compress(range(3,					A_,					2 ),					A_ ) )


if __name__ == "__main__":
    import doctest

    doctest.testmod()

