def 	lowerCamelCase					(	UpperCamelCase     :				int = 10_00							)   ->    int:
		_lowerCamelCase				   =  -1
		_lowerCamelCase				   =  0
		for a in range(1			,       n // 3							):
				# Solving the two equations a**2+b**2=c**2 and a+b+c=N eliminating c
				_lowerCamelCase				   =  (n * n - 2 * a * n) // (2 * n - 2 * a)
				_lowerCamelCase				   =  n - a - b
				if c * c == (a * a + b * b):
						_lowerCamelCase				   =  a * b * c
						if candidate >= product:
								_lowerCamelCase				   =  candidate
		return product


if __name__ == "__main__":
				print(F'''{solution() = }''')
def 	lowerCamelCase					(	UpperCamelCase     :				int = 60_08_51_47_51_43							)   ->    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				   =  1
		_lowerCamelCase				   =  2
		while i * i <= n:
				while n % i == 0:
						_lowerCamelCase				   =  i
						n //= i
				i += 1
		if n > 1:
				_lowerCamelCase				   =  n
		return int(UpperCamelCase							)


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