
"""simple docstring"""




import string






def 	a_		(	__lowercase       :     str			)			->  str:
			_snake_case          =      ''
			for i in sequence:
						_snake_case          =      ord(__lowercase			)
						if 65 <= extract <= 90:
									output += chr(155 - extract			)
						elif 97 <= extract <= 122:
									output += chr(219 - extract			)
						else:
									output += i
			return output






def 	a_		(	__lowercase       :     str			)			->  str:
			_snake_case          =      string.ascii_letters
			_snake_case          =      string.ascii_lowercase[::-1] + string.ascii_uppercase[::-1]
			return "".join(
			    letters_reversed[letters.index(__lowercase			)] if c in letters else c for c in sequence			)






def 	a_		(	)			->  None:
			from timeit import timeit

			print('Running performance benchmarks...'			)
			_snake_case          =      'from string import printable ; from __main__ import atbash, atbash_slow'
			print(f'''> atbash_slow(): {timeit('atbash_slow(printable)'	, setup=__lowercase			)} seconds'''			)
			print(f'''>      atbash(): {timeit('atbash(printable)'	, setup=__lowercase			)} seconds'''			)


if __name__ == "__main__":
			for example in ("ABCDEFGH", "123GGjj", "testStringtest", "with space"):
						print(F'{example} encrypted in atbash: {atbash(example)}')
			benchmark()

def 	a_		(	__lowercase       :     list[int]	, __lowercase       :     list[int]			)			->  tuple[float, float]:

			# Check if the input is valid
			if not len(__lowercase			) == len(__lowercase			) == 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
			_snake_case     , _snake_case     , _snake_case          =      equationa
			_snake_case     , _snake_case     , _snake_case          =      equationa

			# Calculate the determinants of the matrices
			_snake_case          =      aa * ba - aa * ba
			_snake_case          =      ca * ba - ca * ba
			_snake_case          =      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:
									_snake_case          =      determinant_x / determinant
									_snake_case          =      determinant_y / determinant
									# Non-Trivial Solution (Consistent system)
									return (x, y)