





'''simple docstring'''




def 			_lowerCAmelCase     (    __snake_case    :					int = 10_00     )	->	int:
     __A		:					Tuple						=			-1
     __A		:					Tuple						=			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
          __A		:					Optional[int]						=			(n * n - 2 * a * n) // (2 * n - 2 * a)
          __A		:					Optional[int]						=			n - a - b
          if c * c == (a * a + b * b):
               __A		:					Optional[Any]						=			a * b * c
               if candidate >= product:
                    __A		:					List[str]						=			candidate
     return product


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

"""simple docstring"""




def 							_lowerCamelCase			(			__a     ):
		if divisor % 5 == 0 or divisor % 2 == 0:
				return 0
		SCREAMING_SNAKE_CASE_    			=			1
		SCREAMING_SNAKE_CASE_    			=			1
		while repunit:
				SCREAMING_SNAKE_CASE_    			=			(10 * repunit + 1) % divisor
				repunit_index += 1
		return repunit_index



def 							_lowerCamelCase			(			__a = 1_000_000     ):
		SCREAMING_SNAKE_CASE_    			=			limit - 1
		if divisor % 2 == 0:
				divisor += 1
		while least_divisible_repunit(__a     ) <= limit:
				divisor += 2
		return divisor


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