
"""simple docstring"""


def        _lowerCamelCase(__UpperCamelCase = 20			)							->					int:

	try:
		_lowerCAmelCase								=int(__UpperCamelCase			)
	except (TypeError, ValueError):
		raise TypeError("""Parameter n must be int or castable to int."""			)
	if n <= 0:
		raise ValueError("""Parameter n must be greater than or equal to one."""			)
	_lowerCAmelCase								=0
	while 1:
		i += n * (n - 1)
		_lowerCAmelCase								=0
		for j in range(2       ,					__UpperCamelCase			):
			if i % j != 0:
				_lowerCAmelCase								=1
				break
		if nfound == 0:
			if i == 0:
				_lowerCAmelCase								=1
			return i
	return None


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





"""simple docstring"""


import math



def        _lowerCamelCase(__UpperCamelCase			)							->					bool:

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



def        _lowerCamelCase(__UpperCamelCase = 600851475143			)							->					int:

	try:
		_lowerCAmelCase								=int(__UpperCamelCase			)
	except (TypeError, ValueError):
		raise TypeError("""Parameter n must be int or castable to int."""			)
	if n <= 0:
		raise ValueError("""Parameter n must be greater than or equal to one."""			)
	_lowerCAmelCase								=0
	if is_prime(__UpperCamelCase			):
		return n
	while n % 2 == 0:
		n //= 2
	if is_prime(__UpperCamelCase			):
		return n
	for i in range(3       ,					int(math.sqrt(__UpperCamelCase			)			) + 1       ,					2			):
		if n % i == 0:
			if is_prime(n // i			):
				_lowerCAmelCase								=n // i
				break
			elif is_prime(__UpperCamelCase			):
				_lowerCAmelCase								=i
	return max_number


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



