




"""simple docstring"""






import re





def 							UpperCAmelCase		(		snake_case			:					str    ):

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

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


if __name__ == "__main__":
				import doctest

				doctest.testmod()












"""simple docstring"""






def 							UpperCAmelCase		(		snake_case			:					int      ,       snake_case			:					int    ):
					return x if y == 0 else greatest_common_divisor(snake_case      ,       x % y    )





def 							UpperCAmelCase		(		snake_case			:					int      ,       snake_case			:					int    ):
					return (x * y) // greatest_common_divisor(snake_case      ,       snake_case    )





def 							UpperCAmelCase		(		snake_case			:					int = 20    ):
					_lowerCAmelCase:List[Any]									=  1
					for i in range(1      ,       n + 1    ):
										_lowerCAmelCase:List[str]									=  lcm(snake_case      ,       snake_case    )
					return g


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






