


'''simple docstring'''







def 	lowercase (_A      ,  _A      ,  _A      ,  _A    ):







       """simple docstring"""







       _lowerCAmelCase			:							List[Any]      	=				int((lower_bound + upper_bound) // 2    )
       if array[r] == value:
              return r
       if lower_bound >= upper_bound:
              return -1
       if array[r] < value:
              return binary_search(_a      ,  r + 1      ,  _a      ,  _a    )
       else:
              return binary_search(_a      ,  _a      ,  r - 1      ,  _a    )






def 	lowercase (_A      ,  _A    ):







       """simple docstring"""







       _lowerCAmelCase			:							Any      	=				0
       if matrix[index][0] == value:
              return [index, 0]
       while index < len(_a    ) and matrix[index][0] < value:
              _lowerCAmelCase			:							List[str]      	=				binary_search(matrix[index]      ,  0      ,  len(matrix[index]    ) - 1      ,  _a    )
              if r != -1:
                     return [index, r]
              index += 1
       return [-1, -1]


if __name__ == "__main__":
       import doctest

       doctest.testmod()









import math

def    lowerCAmelCase__		(			_a				:	int			):

		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    lowerCAmelCase__		(			_a				:	int = 60_08_51_47_51_43			):

		try:
				snake_case_ :							int         =				int(_a			)
		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."			)
		snake_case_ :							Dict         =				0
		if is_prime(_a			):
				return n
		while n % 2 == 0:
				n //= 2
		if is_prime(_a			):
				return n
		for i in range(3     ,					int(math.sqrt(_a			)			) + 1     ,					2			):
				if n % i == 0:
						if is_prime(n // i			):
								snake_case_ :							List[Any]         =				n // i
								break
						elif is_prime(_a			):
								snake_case_ :							str         =				i
		return max_number


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