





def      A__       (    SCREAMING_SNAKE_CASE_   :      int = 10_00						)  ->  int:






   """simple docstring"""







   _UpperCAmelCase       ,      _UpperCAmelCase           =   1, 1
   _UpperCAmelCase           =   []
   for i in range(1				,	n + 1						):
      _UpperCAmelCase           =   prev_numerator + 2 * prev_denominator
      _UpperCAmelCase           =   prev_numerator + prev_denominator
      if len(str(SCREAMING_SNAKE_CASE_						)						) > len(str(SCREAMING_SNAKE_CASE_						)						):
         result.append(SCREAMING_SNAKE_CASE_						)
      _UpperCAmelCase           =   numerator
      _UpperCAmelCase           =   denominator

   return len(SCREAMING_SNAKE_CASE_						)


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






def 						A_							(	_lowerCAmelCase = 1000	)		->					int:
 UpperCamelCase      :   Optional[int]			      =  -1
 UpperCamelCase      :   int			      =  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
  UpperCamelCase      :   Optional[Any]			      =  (n * n - 2 * a * n) // (2 * n - 2 * a)
  UpperCamelCase      :   List[str]			      =  n - a - b
  if c * c == (a * a + b * b):
   UpperCamelCase      :   Union[str, Any]			      =  a * b * c
   if candidate >= product:
    UpperCamelCase      :   Tuple			      =  candidate
 return product


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