






from __future__ import annotations

from string import ascii_letters

def 			__lowerCamelCase     (						snake_case__			,snake_case__			,snake_case__ = None						)				->    str:






						"""simple docstring"""





						_SCREAMING_SNAKE_CASE       =    alphabet or ascii_letters

						# The final result string
						_SCREAMING_SNAKE_CASE       =    """"""

						for character in input_string:
												if character not in alpha:
																		# Append without encryption if character is not in the alphabet
																		result += character
												else:
																		# Get the index of the new key and make sure it isn't too large
																		_SCREAMING_SNAKE_CASE       =    (alpha.index(snake_case__						) + key) % len(snake_case__						)

																		# Append the encoded character to the alphabet
																		result += alpha[new_key]

						return result

def 			__lowerCamelCase     (						snake_case__			,snake_case__			,snake_case__ = None						)				->    str:






						"""simple docstring"""





						key *= -1

						return encrypt(snake_case__			,snake_case__			,snake_case__						)

def 			__lowerCamelCase     (						snake_case__			,snake_case__ = None						)				->    dict[int, str]:






						"""simple docstring"""





						_SCREAMING_SNAKE_CASE       =    alphabet or ascii_letters

						# To store data on all the combinations
						_SCREAMING_SNAKE_CASE       =    {}

						# Cycle through each combination
						for key in range(1			,len(snake_case__						) + 1						):
												# Decrypt the message and store the result in the data
												_SCREAMING_SNAKE_CASE       =    decrypt(snake_case__			,snake_case__			,snake_case__						)

						return brute_force_data


if __name__ == "__main__":
		while True:
				print(f"\n{'-' * 10}\n Menu\n{'-' * 10}")
				print(*['''1.Encrypt''', '''2.Decrypt''', '''3.BruteForce''', '''4.Quit'''], sep='''\n''')

				# get user input
				UpperCamelCase												=      input('''\nWhat would you like to do?: ''').strip() or '''4'''

				# run functions based on what the user chose
				if choice not in ("1", "2", "3", "4"):
						print('''Invalid choice, please enter a valid choice''')
				elif choice == "1":
						UpperCamelCase												=      input('''Please enter the string to be encrypted: ''')
						UpperCamelCase												=      int(input('''Please enter off-set: ''').strip())

						print(encrypt(input_string, key))
				elif choice == "2":
						UpperCamelCase												=      input('''Please enter the string to be decrypted: ''')
						UpperCamelCase												=      int(input('''Please enter off-set: ''').strip())

						print(decrypt(input_string, key))
				elif choice == "3":
						UpperCamelCase												=      input('''Please enter the string to be decrypted: ''')
						UpperCamelCase												=      brute_force(input_string)

						for key, value in brute_force_data.items():
								print(f"Key: {key} | Message: {value}")

				elif choice == "4":
						print('''Goodbye.''')
						break









from __future__ import annotations

def 			__lowerCamelCase     (						snake_case__			,snake_case__						)				->    Dict:






						"""simple docstring"""





						_SCREAMING_SNAKE_CASE       =    0
						_SCREAMING_SNAKE_CASE       =    len(snake_case__						) - 1
						while left <= right:
												_SCREAMING_SNAKE_CASE       =    (left + right) // 2
												if left == right:
																		if sorted_list[middle] < item:
																								_SCREAMING_SNAKE_CASE       =    middle + 1
																		break
												elif sorted_list[middle] < item:
																		_SCREAMING_SNAKE_CASE       =    middle + 1
												else:
																		_SCREAMING_SNAKE_CASE       =    middle - 1
						sorted_list.insert(snake_case__			,snake_case__						)
						return sorted_list

def 			__lowerCamelCase     (						snake_case__			,snake_case__						)				->    Optional[Any]:






						"""simple docstring"""





						_SCREAMING_SNAKE_CASE       =    []
						while left and right:
												if left[0][0] < right[0][0]:
																		result.append(left.pop(0						)						)
												else:
																		result.append(right.pop(0						)						)
						return result + left + right

def 			__lowerCamelCase     (						snake_case__						)				->    List[str]:






						"""simple docstring"""





						_SCREAMING_SNAKE_CASE       =    len(snake_case__						)
						if length <= 1:
												return list_ad
						_SCREAMING_SNAKE_CASE       =    length // 2
						return merge(sortlist_ad(list_ad[:middle]						)			,sortlist_ad(list_ad[middle:]						)						)

def 			__lowerCamelCase     (						snake_case__						)				->    list[int]:






						"""simple docstring"""





						if len(snake_case__						) <= 1:
												return collection
						_SCREAMING_SNAKE_CASE       =    []
						_SCREAMING_SNAKE_CASE       =    False
						for i in range(0			,len(snake_case__						)			,2						):
												if i == len(snake_case__						) - 1:
																		_SCREAMING_SNAKE_CASE       =    True
												else:
																		if collection[i] < collection[i + 1]:
																								two_paired_list.append([collection[i], collection[i + 1]]						)
																		else:
																								two_paired_list.append([collection[i + 1], collection[i]]						)
						_SCREAMING_SNAKE_CASE       =    sortlist_ad(snake_case__						)
						_SCREAMING_SNAKE_CASE       =    [i[0] for i in sorted_list_ad]
						result.append(sorted_list_ad[-1][1]						)
						if has_last_odd_item:
												_SCREAMING_SNAKE_CASE       =    collection[-1]
												_SCREAMING_SNAKE_CASE       =    binary_search_insertion(snake_case__			,snake_case__						)
						_SCREAMING_SNAKE_CASE       =    False
						for i in range(len(snake_case__						) - 1						):
												if result[i] == collection[-1] and has_last_odd_item:
																		_SCREAMING_SNAKE_CASE       =    True
												_SCREAMING_SNAKE_CASE       =    sorted_list_ad[i][1]
												# If last_odd_item is inserted before the item's index,
												# you should forward index one more.
												if is_last_odd_item_inserted_before_this_index:
																		_SCREAMING_SNAKE_CASE       =    result[: i + 2] + binary_search_insertion(result[i + 2 :]			,snake_case__						)
												else:
																		_SCREAMING_SNAKE_CASE       =    result[: i + 1] + binary_search_insertion(result[i + 1 :]			,snake_case__						)

						return result


if __name__ == "__main__":
		UpperCamelCase												=      input('''Enter numbers separated by a comma:\n''').strip()
		UpperCamelCase												=      [int(item) for item in user_input.split(''',''')]
		print(merge_insertion_sort(unsorted))

