code: 
  
  
  import math
  
  
  
  
  
  
  
  def  _lowerCamelCase(			lowercase__			)		->			bool:
  
  		'''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(lowercase__			) + 1			)     ,				6			):
  				if number % i == 0 or number % (i + 2) == 0:
  						return False
  		return True
  
  
  
  
  
  
  
  def  _lowerCamelCase(			lowercase__ = 1_0_0_0     ,				lowercase__ = 1_0_0_0			)		->			int:
  
  		'''simple docstring'''
  
  
  
  
  
  
  
  		__lowercase=    [0, 0, 0]  # length, a, b
  		for a in range((a_limit * -1) + 1     ,				lowercase__			):
  				for b in range(2     ,				lowercase__			):
  						if is_prime(lowercase__			):
  								__lowercase=    0
  								__lowercase=    0
  								while is_prime((n**2) + (a * n) + b			):
  										count += 1
  										n += 1
  								if count > longest[0]:
  										__lowercase=    [count, a, b]
  		__lowercase=    longest[1] * longest[2]
  		return ans
  
  
  if __name__ == "__main__":
  	print(solution(1_0_0_0, 1_0_0_0))
  
  
  
  
  
  
  
style_context: 
  
  
  def  _lowerCamelCase(			lowercase__			)		->			str:
  
  		'''simple docstring'''
  
  
  
  
  
  
  
  		return " ".join([word[::-1] for word in input_str.split()]			)
  
  
  if __name__ == "__main__":
  	import doctest
  
  	doctest.testmod()
  
  
  
  
  
  
  