


'''simple docstring'''
import string


def      a (     __a  )    ->      None:



					'''simple docstring'''






					for key in range(len(string.ascii_uppercase  )  ):
										UpperCamelCase__  :str				   =					''''''
										for symbol in message:
															if symbol in string.ascii_uppercase:
																				UpperCamelCase__  :Dict				   =					string.ascii_uppercase.find(__a  )
																				UpperCamelCase__  :List[str]				   =					num - key
																				if num < 0:
																									UpperCamelCase__  :List[str]				   =					num + len(string.ascii_uppercase  )
																				UpperCamelCase__  :str				   =					translated + string.ascii_uppercase[num]
															else:
																				UpperCamelCase__  :Union[str, Any]				   =					translated + symbol
										print(f'''Decryption using Key #{key}: {translated}'''  )


def      a (     )    ->      None:



					'''simple docstring'''






					UpperCamelCase__  :Optional[int]				   =					input('''Encrypted message: '''  )
					UpperCamelCase__  :int				   =					message.upper()
					decrypt(__a  )


if __name__ == "__main__":
		import doctest

		doctest.testmod()
		main()



'''simple docstring'''
from __future__ import annotations

import math


def      a (     __a					,   __a					,   __a					,   __a					,   __a  )    ->      int:



					'''simple docstring'''






					if depth < 0:
										raise ValueError('''Depth cannot be less than 0'''  )

					if len(__a  ) == 0:
										raise ValueError('''Scores cannot be empty'''  )

					if depth == height:
										return scores[node_index]

					if is_max:
										return max(
										    minimax(depth + 1					,   node_index * 2					,   __a					,   __a					,   __a  )					,   minimax(depth + 1					,   node_index * 2 + 1					,   __a					,   __a					,   __a  )					,   )

					return min(
					    minimax(depth + 1					,   node_index * 2					,   __a					,   __a					,   __a  )					,   minimax(depth + 1					,   node_index * 2 + 1					,   __a					,   __a					,   __a  )					,   )


def      a (     )    ->      None:



					'''simple docstring'''






					UpperCamelCase__  :str				   =					[90, 23, 6, 33, 21, 65, 123, 34423]
					UpperCamelCase__  :List[Any]				   =					math.log(len(__a  )					,   2  )
					print('''Optimal value : '''					,   end=''''''  )
					print(minimax(0					,   0					,   __a					,   __a					,   __a  )  )


if __name__ == "__main__":
		import doctest

		doctest.testmod()
		main()