






from typing import Literal

UpperCamelCase__						:      Union[str, Any]								=					"""ABCDEFGHIJKLMNOPQRSTUVWXYZ"""





def   SCREAMING_SNAKE_CASE__						(   snake_case_,  snake_case_,  snake_case_  )   ->  str:


	"""simple docstring"""



	a		=			LETTERS if mode == '''decrypt''' else key
	a		=			key if mode == '''decrypt''' else LETTERS
	a		=			''''''
	# loop through each symbol in the message
	for symbol in message:
		if symbol.upper() in chars_a:
			# encrypt/decrypt the symbol
			a		=			chars_a.find(symbol.upper()  )
			if symbol.isupper():
				translated += chars_b[sym_index].upper()
			else:
				translated += chars_b[sym_index].lower()
		else:
			# symbol is not in LETTERS, just add it
			translated += symbol
	return translated





def   SCREAMING_SNAKE_CASE__						(   snake_case_,  snake_case_  )   ->  str:


	"""simple docstring"""



	return translate_message(snake_case_,  snake_case_,  '''encrypt'''  )





def   SCREAMING_SNAKE_CASE__						(   snake_case_,  snake_case_  )   ->  str:


	"""simple docstring"""



	return translate_message(snake_case_,  snake_case_,  '''decrypt'''  )





def   SCREAMING_SNAKE_CASE__						(   )   ->  None:


	"""simple docstring"""



	a		=			'''Hello World'''
	a		=			'''QWERTYUIOPASDFGHJKLZXCVBNM'''
	a		=			'''decrypt'''  # set to 'encrypt' or 'decrypt'

	if mode == "encrypt":
		a		=			encrypt_message(snake_case_,  snake_case_  )
	elif mode == "decrypt":
		a		=			decrypt_message(snake_case_,  snake_case_  )
	print(f"""Using the key {key}, the {mode}ed message is: {translated}"""  )


if __name__ == "__main__":
				import doctest

				doctest.testmod()
				main()













UpperCamelCase__						:      Dict								=					10**8





def   SCREAMING_SNAKE_CASE__						(   snake_case_  )   ->  bool:


	"""simple docstring"""



	if n % 1_0 == 0:
		return False
	a		=			str(snake_case_  )
	return s == s[::-1]





def   SCREAMING_SNAKE_CASE__						(   )   ->  int:


	"""simple docstring"""



	a		=			set()
	a		=			1
	a		=			5
	while sum_squares < LIMIT:
		a		=			first_square + 1
		while sum_squares < LIMIT:
			if is_palindrome(snake_case_  ):
				answer.add(snake_case_  )
			last_square += 1
			sum_squares += last_square**2
		first_square += 1
		a		=			first_square**2 + (first_square + 1) ** 2

	return sum(snake_case_  )


if __name__ == "__main__":
				print(solution())





