
def  lowerCAmelCase__			(  )				->		int:
			return [
			    a * b * (1_000 - a - b)
			    for a in range(1       ,							999     )
			    for b in range(SCREAMING_SNAKE_CASE_       ,							999     )
			    if (a * a + b * b == (1_000 - a - b) ** 2)
			][0]


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

import re
def  lowerCAmelCase__			(  SCREAMING_SNAKE_CASE_     )				->		str:

			if len(re.findall('[ATCG]'       ,							SCREAMING_SNAKE_CASE_     )     ) != len(SCREAMING_SNAKE_CASE_     ):
						raise ValueError('Invalid Strand'     )

			return dna.translate(dna.maketrans('ATCG'       ,							'TAGC'     )     )


if __name__ == "__main__":
					import doctest

					doctest.testmod()