'''simple docstring'''




def __lowerCAmelCase (							)	->    int:
    return [
        a * b * (10_00 - a - b)
        for a in range(1				,  9_99				)
        for b in range(UpperCamelCase__				,  9_99				)
        if (a * a + b * b == (10_00 - a - b) ** 2)
    ][0]


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



'''simple docstring'''



from itertools import count







def    a__       (  a__ = 50						):




     """simple docstring"""


     __SCREAMING_SNAKE_CASE     =      [1] * min_block_length

     for n in count(a__						):
          fill_count_functions.append(1						)

          for block_length in range(a__      ,    n + 1						):
               for block_start in range(n - block_length						):
                    fill_count_functions[n] += fill_count_functions[
                        n - block_start - block_length - 1
                    ]

               fill_count_functions[n] += 1

          if fill_count_functions[n] > 1_00_00_00:
               break

     return n


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






