




'''simple docstring'''





def       __a      (  _UpperCamelCase:       int = 1_000       )		->					int:

     """simple docstring"""




     _snake_case				= -1
     _snake_case				= 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
          _snake_case				= (n * n - 2 * a * n) // (2 * n - 2 * a)
          _snake_case				= n - a - b
          if c * c == (a * a + b * b):
               _snake_case				= a * b * c
               if candidate >= product:
                    _snake_case				= candidate
     return product


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








'''simple docstring'''





from __future__ import annotations

import collections
import pprint
from pathlib import Path





def       __a      (  _UpperCamelCase:       str       )		->					str:

     """simple docstring"""




     return "".join(sorted(_UpperCamelCase       )       )





def       __a      (  _UpperCamelCase:       str       )		->					list[str]:

     """simple docstring"""




     return word_by_signature[signature(_UpperCamelCase       )]


UpperCamelCase_		:     str          =		Path(__file__).parent.joinpath('''words.txt''').read_text(encoding='''utf-8''')
UpperCamelCase_		:     Dict          =		sorted({word.strip().lower() for word in data.splitlines()})

UpperCamelCase_		:     Optional[Any]          =		collections.defaultdict(list)
for word in word_list:
   word_by_signature[signature(word)].append(word)

if __name__ == "__main__":
   UpperCamelCase_		:     List[str]          =		{word: anagram(word) for word in word_list if len(anagram(word)) > 1}

   with open('''anagrams.txt''', '''w''') as file:
      file.write('''all_anagrams = \n ''')
      file.write(pprint.pformat(all_anagrams))


