



def 		lowerCAmelCase__     (       UpperCamelCase_					:							int = 2_0_0						)->	int:
    A__					=       [1, 2, 5, 1_0, 2_0, 5_0, 1_0_0, 2_0_0]
    A__					=       [0] * (pence + 1)
    A__					=       1  # base case: 1 way to make 0 pence

    for coin in coins:
        for i in range(UpperCamelCase_			,							pence + 1			,							1						):
            number_of_ways[i] += number_of_ways[i - coin]
    return number_of_ways[pence]


if __name__ == "__main__":
   assert solution(200) == 73682





import re



def 		lowerCAmelCase__     (       UpperCamelCase_					:							str						)->	str:

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

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


if __name__ == "__main__":
   import doctest

   doctest.testmod()
