




from __future__ import annotations

from collections import deque
from enum import Enum
from math import atana, degrees
from sys import maxsize
class      _UpperCamelCase (			lowerCAmelCase						):
      UpperCAmelCase_            =						1
      UpperCAmelCase_            =						2
      UpperCAmelCase_            =						3
      def __repr__(     self				:Dict )       ->     Any:
       return f'''{self.__class__.__name__}.{self.name}'''



def   lowerCAmelCase						(						_lowerCAmelCase							:				tuple[int, int]  ,							_lowerCAmelCase							:				int  ,							_lowerCAmelCase							:				int		):




 """simple docstring"""







 UpperCAmelCase__	,	UpperCAmelCase__								=  point
 return degrees(atana(y - miny  ,							x - minx		)		)



def   lowerCAmelCase						(						_lowerCAmelCase							:				tuple[int, int]  ,							_lowerCAmelCase							:				tuple[int, int]  ,							_lowerCAmelCase							:				tuple[int, int]		):




 """simple docstring"""







 UpperCAmelCase__	,	UpperCAmelCase__								=  starting
 UpperCAmelCase__	,	UpperCAmelCase__								=  via
 UpperCAmelCase__	,	UpperCAmelCase__								=  target
 UpperCAmelCase__								=  degrees(atana(ya - ya  ,							xa - xa		)		)
 via_angle %= 360
 UpperCAmelCase__								=  degrees(atana(ya - ya  ,							xa - xa		)		)
 target_angle %= 360
 # t-
 #  \ \
 #   \ v
 #    \|
 #     s
 # via_angle is always lower than target_angle, if direction is left.
 # If they are same, it means they are on a same line of convex hull.
 if target_angle > via_angle:
  return Direction.left
 elif target_angle == via_angle:
  return Direction.straight
 else:
  return Direction.right



def   lowerCAmelCase						(						_lowerCAmelCase							:				list[tuple[int, int]]		):




 """simple docstring"""







 if len(SCREAMING_SNAKE_CASE_		) <= 2:
  # There is no convex hull
  raise ValueError("graham_scan: argument must contain more than 3 points."		)
 if len(SCREAMING_SNAKE_CASE_		) == 3:
  return points
 # find the lowest and the most left point
 UpperCAmelCase__								=  0
 UpperCAmelCase__	,	UpperCAmelCase__								=  maxsize, maxsize
 for i, point in enumerate(SCREAMING_SNAKE_CASE_		):
  UpperCAmelCase__								=  point[0]
  UpperCAmelCase__								=  point[1]
  if y < miny:
   UpperCAmelCase__								=  y
   UpperCAmelCase__								=  x
   UpperCAmelCase__								=  i
  if y == miny and x < minx:
   UpperCAmelCase__								=  x
   UpperCAmelCase__								=  i

    # remove the lowest and the most left point from points for preparing for sort
 points.pop(SCREAMING_SNAKE_CASE_		)

 UpperCAmelCase__								=  sorted(SCREAMING_SNAKE_CASE_  ,							key=lambda _lowerCAmelCase		: angle_comparer(SCREAMING_SNAKE_CASE_  ,							SCREAMING_SNAKE_CASE_  ,							SCREAMING_SNAKE_CASE_		)		)
 # This insert actually costs complexity,
 # and you should instead add (minx, miny) into stack later.
 # I'm using insert just for easy understanding.
 sorted_points.insert(0  ,							(minx, miny)		)

 UpperCAmelCase__								=  deque()
 stack.append(sorted_points[0]		)
 stack.append(sorted_points[1]		)
 stack.append(sorted_points[2]		)
 # In any ways, the first 3 points line are towards left.
 # Because we sort them the angle from minx, miny.
 UpperCAmelCase__								=  Direction.left

 for i in range(3  ,							len(SCREAMING_SNAKE_CASE_		)		):
  while True:
   UpperCAmelCase__								=  stack[-2]
   UpperCAmelCase__								=  stack[-1]
   UpperCAmelCase__								=  sorted_points[i]
   UpperCAmelCase__								=  check_direction(SCREAMING_SNAKE_CASE_  ,							SCREAMING_SNAKE_CASE_  ,							SCREAMING_SNAKE_CASE_		)

   if next_direction == Direction.left:
    UpperCAmelCase__								=  Direction.left
    break
   if next_direction == Direction.straight:
    if current_direction == Direction.left:
     # We keep current_direction as left.
     # Because if the straight line keeps as straight,
     # we want to know if this straight line is towards left.
     break
    elif current_direction == Direction.right:
     # If the straight line is towards right,
     # every previous points on those straigh line is not convex hull.
     stack.pop()
   if next_direction == Direction.right:
    stack.pop()
  stack.append(sorted_points[i]		)
 return list(SCREAMING_SNAKE_CASE_		)











from __future__ import annotations

from string import ascii_letters



def   lowerCAmelCase						(						_lowerCAmelCase							:				str  ,							_lowerCAmelCase							:				int  ,							_lowerCAmelCase							:				str | None = None		):




 """simple docstring"""







 UpperCAmelCase__								=  alphabet or ascii_letters

 # The final result string
 UpperCAmelCase__								=  ""

 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
   UpperCAmelCase__								=  (alpha.index(_lowerCAmelCase		) + key) % len(_lowerCAmelCase		)

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

 return result



def   lowerCAmelCase						(						_lowerCAmelCase							:				str  ,							_lowerCAmelCase							:				int  ,							_lowerCAmelCase							:				str | None = None		):




 """simple docstring"""







 key *= -1

 return encrypt(_lowerCAmelCase  ,							_lowerCAmelCase  ,							_lowerCAmelCase		)



def   lowerCAmelCase						(						_lowerCAmelCase							:				str  ,							_lowerCAmelCase							:				str | None = None		):




 """simple docstring"""







 UpperCAmelCase__								=  alphabet or ascii_letters

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

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

 return brute_force_data


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

    # get user input
    _lowerCAmelCase  :				List[Any]						=				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":
      _lowerCAmelCase  :				Any						=				input("Please enter the string to be encrypted: ")
      _lowerCAmelCase  :				str						=				int(input("Please enter off-set: ").strip())

      print(encrypt(input_string, key))
    elif choice == "2":
      _lowerCAmelCase  :				Optional[Any]						=				input("Please enter the string to be decrypted: ")
      _lowerCAmelCase  :				Any						=				int(input("Please enter off-set: ").strip())

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

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

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





