






"""simple docstring"""


import math




def 			snake_case  (A_      :int      ):







  '''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 			snake_case  (A_      :int = 1_0_0_0	,			A_      :int = 1_0_0_0      ):







  '''simple docstring'''

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


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












"""simple docstring"""


def 			snake_case  (A_      :int = 1_0_0_0      ):







  '''simple docstring'''

  a     :			Union[str, Any]				=   0
  a     :			int				=   (n - 1) // 3
  total += ((terms) * (6 + (terms - 1) * 3)) // 2  # total of an A.P.
  a     :			Tuple				=   (n - 1) // 5
  total += ((terms) * (1_0 + (terms - 1) * 5)) // 2
  a     :			Dict				=   (n - 1) // 1_5
  total -= ((terms) * (3_0 + (terms - 1) * 1_5)) // 2
  return total


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




