'''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() = }')


def     __lowerCAmelCase			(			a__  )       ->  str:
				__a										=    []
				__a										=    set({'''(''', '''[''', '''{'''}  )
				__a										=    set({''')''', ''']''', '''}'''}  )
				__a										=    {'''{''': '''}''', '''[''': ''']''', '''(''': ''')'''}

				for i in range(len(a__  )  ):
								if s[i] in open_brackets:
												stack.append(s[i]  )

								elif s[i] in closed_brackets and (
								    len(a__  ) == 0 or (len(a__  ) > 0 and open_to_closed[stack.pop()] != s[i])
								):
												return False

				return len(a__  ) == 0


def     __lowerCAmelCase			(			)       ->  Dict:
				__a										=    input('''Enter sequence of brackets: '''  )
				if is_balanced(a__  ):
								print(a__						,    '''is balanced'''  )
				else:
								print(a__						,    '''is not balanced'''  )


if __name__ == "__main__":
					main()