





'''simple docstring'''



from itertools import combinations, product




def       _lowerCAmelCase  ( lowerCamelCase_	:     int						,				lowerCamelCase_	:     int						,				lowerCamelCase_	:     int						,				lowerCamelCase_	:     int ):
			if xa == ya == 0 or xa == ya == 0:
						return False
			__lowercase   =							xa * xa + ya * ya
			__lowercase   =							xa * xa + ya * ya
			__lowercase   =							(xa - xa) * (xa - xa) + (ya - ya) * (ya - ya)
			return (
			    a_square + b_square == c_square
			    or a_square + c_square == b_square
			    or b_square + c_square == a_square
			)




def       _lowerCAmelCase  ( lowerCamelCase_	:     int = 5_0 ):
			return sum(
			    1
			    for pta, pta in combinations(product(range(limit + 1 )						,				repeat=2 )						,				2 )
			    if is_right(*lowerCamelCase_						,				*lowerCamelCase_ ) )


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












'''simple docstring'''



import math




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




def       _lowerCAmelCase  ( lowerCamelCase_	:     int = 6_0_0_8_5_1_4_7_5_1_4_3 ):

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


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





