





from __future__ import annotations







def        __lowerCamelCase (							__a       :list[int | float]   ,					__a       :int   ,					__a       :int   )		->    int | float:






		"""simple docstring"""

		if len(__a   ) == 0:
				raise ValueError("""find_max() arg is an empty sequence"""   )
		if (
		    left >= len(__a   )
		    or left < -len(__a   )
		    or right >= len(__a   )
		    or right < -len(__a   )
		):
				raise IndexError("""list index out of range"""   )
		if left == right:
				return nums[left]
		A__  				=       (left + right) >> 1  # the middle
		A__  				=       find_max(__a   ,					__a   ,					__a   )  # find max in range[left, mid]
		A__  				=       find_max(__a   ,					mid + 1   ,					__a   )  # find max in range[mid + 1, right]

		return left_max if left_max >= right_max else right_max


if __name__ == "__main__":
					import doctest

					doctest.testmod(verbose=True)










from maths.is_square_free import is_square_free
from maths.prime_factors import prime_factors







def        __lowerCamelCase (							__a       :int   )		->    int:






		"""simple docstring"""

		A__  				=       prime_factors(__a   )
		if is_square_free(__a   ):
				return -1 if len(__a   ) % 2 else 1
		return 0


if __name__ == "__main__":
					import doctest

					doctest.testmod()



