



def 							A     (					_UpperCAmelCase    :       str   )    ->			str:







			'''simple docstring'''
			_UpperCAmelCase			=       ''
			for ch in key:
						if ch == " " or ch not in key_no_dups and ch.isalpha():
									key_no_dups += ch
			return key_no_dups





def 							A     (					_UpperCAmelCase    :       str   )    ->			dict[str, str]:







			'''simple docstring'''
			_UpperCAmelCase			=       [chr(i + 65   ) for i in range(26   )]
			# Remove duplicate characters from key
			_UpperCAmelCase			=       remove_duplicates(key.upper()   )
			_UpperCAmelCase			=       len(_UpperCAmelCase   )
			# First fill cipher with key characters
			_UpperCAmelCase			=       {alphabet[i]: char for i, char in enumerate(_UpperCAmelCase   )}
			# Then map remaining characters in alphabet to
			# the alphabet from the beginning
			for i in range(len(_UpperCAmelCase   )							,       26   ):
						_UpperCAmelCase			=       alphabet[i - offset]
						# Ensure we are not mapping letters to letters previously mapped
						while char in key:
									offset -= 1
									_UpperCAmelCase			=       alphabet[i - offset]
						_UpperCAmelCase			=       char
			return cipher_alphabet





def 							A     (					_UpperCAmelCase    :       str							,       _UpperCAmelCase    :       dict[str, str]   )    ->			str:







			'''simple docstring'''
			return "".join(cipher_map.get(_UpperCAmelCase							,       _UpperCAmelCase   ) for ch in message.upper()   )





def 							A     (					_UpperCAmelCase    :       str							,       _UpperCAmelCase    :       dict[str, str]   )    ->			str:







			'''simple docstring'''
			_UpperCAmelCase			=       {v: k for k, v in cipher_map.items()}
			return "".join(rev_cipher_map.get(_UpperCAmelCase							,       _UpperCAmelCase   ) for ch in message.upper()   )





def 							A     (					)    ->			None:







			'''simple docstring'''
			_UpperCAmelCase			=       input('Enter message to encode or decode: '   ).strip()
			_UpperCAmelCase			=       input('Enter keyword: '   ).strip()
			_UpperCAmelCase			=       input('Encipher or decipher? E/D:'   ).strip()[0].lower()
			try:
						_UpperCAmelCase			=       {'e': encipher, 'd': decipher}[option]
			except KeyError:
						raise KeyError('invalid input option'   )
			_UpperCAmelCase			=       create_cipher_map(_UpperCAmelCase   )
			print(func(_UpperCAmelCase							,       _UpperCAmelCase   )   )


if __name__ == "__main__":
							import doctest

							doctest.testmod()
							main()





def 							A     (					_UpperCAmelCase    :       int   )    ->			"list[int]":







			'''simple docstring'''
			if upper_limit < 0:
						raise ValueError('Limit for the Catalan sequence must be ≥ 0'   )

			_UpperCAmelCase			=       [0] * (upper_limit + 1)

			# Base case: C(0) = C(1) = 1
			_UpperCAmelCase			=       1
			if upper_limit > 0:
						_UpperCAmelCase			=       1

			# Recurrence relation: C(i) = sum(C(j).C(i-j-1)), from j = 0 to i
			for i in range(2							,       upper_limit + 1   ):
						for j in range(_UpperCAmelCase   ):
									catalan_list[i] += catalan_list[j] * catalan_list[i - j - 1]

			return catalan_list


if __name__ == "__main__":
							print("\n********* Catalan Numbers Using Dynamic Programming ************\n")
							print("\n*** Enter -1 at any time to quit ***")
							print("\nEnter the upper limit (≥ 0) for the Catalan number sequence: ", end="")
							try:
														while True:
																					UpperCAmelCase__       =	int(input().strip())
																					if N < 0:
																												print("\n********* Goodbye!! ************")
																												break
																					else:
																												print(f"""The Catalan numbers from 0 through {N} are:""")
																												print(catalan_numbers(N))
																												print("Try another upper limit for the sequence: ", end="")
							except (NameError, ValueError):
														print("\n********* Invalid input, goodbye! ************\n")

							import doctest

							doctest.testmod()
