



def 		lowerCAmelCase__     (       UpperCamelCase_					:							list[int]			,							UpperCamelCase_					:							list[int]						)->	tuple[float, float]:

    # Check if the input is valid
    if not len(UpperCamelCase_						) == len(UpperCamelCase_						) == 3:
        raise ValueError('''Please enter a valid equation.'''						)
    if equationa[0] == equationa[1] == equationa[0] == equationa[1] == 0:
        raise ValueError('''Both a & b of two equations can\'t be zero.'''						)

    # Extract the coefficients
    A__			,						A__			,						A__					=       equationa
    A__			,						A__			,						A__					=       equationa

    # Calculate the determinants of the matrices
    A__					=       aa * ba - aa * ba
    A__					=       ca * ba - ca * ba
    A__					=       aa * ca - aa * ca

    # Check if the system of linear equations has a solution (using Cramer's rule)
    if determinant == 0:
        if determinant_x == determinant_y == 0:
            raise ValueError('''Infinite solutions. (Consistent system)'''						)
        else:
            raise ValueError('''No solution. (Inconsistent system)'''						)
    else:
        if determinant_x == determinant_y == 0:
            # Trivial solution (Inconsistent system)
            return (0.0, 0.0)
        else:
            A__					=       determinant_x / determinant
            A__					=       determinant_y / determinant
            # Non-Trivial Solution (Consistent system)
            return (x, y)





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()
