
import math


def  A			(   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  A			(   lowercase = 600_851_475_143					)  ->    int:
		'''simple docstring'''

		try:
				UpperCamelCase            =	int(lowercase					)
		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.'					)
		UpperCamelCase            =	0
		if is_prime(lowercase					):
				return n
		while n % 2 == 0:
				n //= 2
		if is_prime(lowercase					):
				return n
		for i in range(3       ,			int(math.sqrt(lowercase					)					) + 1       ,			2					):
				if n % i == 0:
						if is_prime(n // i					):
								UpperCamelCase            =	n // i
								break
						elif is_prime(lowercase					):
								UpperCamelCase            =	i
		return max_number


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


def  A			(   lowercase					)  ->    int:
		'''simple docstring'''

		return int(lowercase					) if x - int(lowercase					) >= 0 else int(lowercase					) - 1


if __name__ == "__main__":
					import doctest

					doctest.testmod()
