


import math






def 		lowercase_(  SCREAMING_SNAKE_CASE_     ):


  '''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(SCREAMING_SNAKE_CASE_     ) + 1     )				,						6     ):
    if number % i == 0 or number % (i + 2) == 0:
      return False
  return True






def 		lowercase_(  SCREAMING_SNAKE_CASE_ = 1000				,						SCREAMING_SNAKE_CASE_ = 1000     ):


  '''simple docstring'''

  lowerCamelCase			: str   =    [0, 0, 0]  # length, a, b
  for a in range((a_limit * -1) + 1				,						SCREAMING_SNAKE_CASE_     ):
    for b in range(2				,						SCREAMING_SNAKE_CASE_     ):
      if is_prime(SCREAMING_SNAKE_CASE_     ):
        lowerCamelCase			: List[str]   =    0
        lowerCamelCase			: Optional[Any]   =    0
        while is_prime((n**2) + (a * n) + b     ):
          count += 1
          n += 1
        if count > longest[0]:
          lowerCamelCase			: Optional[Any]   =    [count, a, b]
  lowerCamelCase			: Any   =    longest[1] * longest[2]
  return ans


if __name__ == "__main__":
   print(solution(10_00, 10_00))







def 		lowercase_(  SCREAMING_SNAKE_CASE_     ):


  '''simple docstring'''

  if number != int(SCREAMING_SNAKE_CASE_     ):
    raise ValueError("factorial() only accepts integral values"     )
  if number < 0:
    raise ValueError("factorial() not defined for negative values"     )
  lowerCamelCase			: Optional[Any]   =    1
  for i in range(1				,						number + 1     ):
    value *= i
  return value






def 		lowercase_(  SCREAMING_SNAKE_CASE_     ):


  '''simple docstring'''

  if not isinstance(SCREAMING_SNAKE_CASE_				,						SCREAMING_SNAKE_CASE_     ):
    raise ValueError("factorial() only accepts integral values"     )
  if n < 0:
    raise ValueError("factorial() not defined for negative values"     )
  return 1 if n == 0 or n == 1 else n * factorial(n - 1     )


if __name__ == "__main__":
   import doctest

   doctest.testmod()

   _snake_case					=					int(input('''Enter a positive integer: ''').strip() or 0)
   print(f'''factorial{n} is {factorial(n)}''')



