






from __future__ import annotations

from typing import Any


class 					_snake_case						:






	def __init__(		self					,UpperCamelCase = 6       )						->    None:
					snake_case__      :Node | None         =   None
					snake_case__      :Node | None         =   None
					self.create_linked_list(UpperCamelCase       )






	def    lowerCAmelCase_							(		self					,UpperCamelCase       )						->    None:
					snake_case__      :List[Any]         =   Node()
					snake_case__      :Optional[Any]         =   current_node
					snake_case__      :Dict         =   current_node
					snake_case__      :str         =   current_node
					for _ in range(1					,UpperCamelCase       ):
									snake_case__      :Any         =   Node()
									snake_case__      :List[Any]         =   current_node
									snake_case__      :List[Any]         =   previous_node
									snake_case__      :List[Any]         =   current_node
					snake_case__      :Tuple         =   self.front
					snake_case__      :Dict         =   previous_node






	def    lowerCAmelCase_							(		self       )						->    bool:
					return (
					    self.front == self.rear
					    and self.front is not None
					    and self.front.data is None
					)






	def    lowerCAmelCase_							(		self       )						->    Any | None:
					self.check_can_perform_operation()
					return self.front.data if self.front else None






	def    lowerCAmelCase_							(		self					,UpperCamelCase       )						->    None:
					if self.rear is None:
									return

					self.check_is_full()
					if not self.is_empty():
									snake_case__      :Union[str, Any]         =   self.rear.next
					if self.rear:
									snake_case__      :int         =   data






	def    lowerCAmelCase_							(		self       )						->    Any:
					self.check_can_perform_operation()
					if self.rear is None or self.front is None:
									return None
					if self.front == self.rear:
									snake_case__      :Tuple         =   self.front.data
									snake_case__      :List[str]         =   None
									return data

					snake_case__      :Tuple         =   self.front
					snake_case__      :Optional[Any]         =   old_front.next
					snake_case__      :str         =   old_front.data
					snake_case__      :Dict         =   None
					return data






	def    lowerCAmelCase_							(		self       )						->    None:
					if self.is_empty():
									raise Exception("Empty Queue"       )






	def    lowerCAmelCase_							(		self       )						->    None:
					if self.rear and self.rear.next == self.front:
									raise Exception("Full Queue"       )




class 					_snake_case						:






	def __init__(		self       )						->    None:
					snake_case__      :Any | None         =   None
					snake_case__      :Node | None         =   None
					snake_case__      :Node | None         =   None


if __name__ == "__main__":
	import doctest

	doctest.testmod()







def 					lowercase_ (    __snake_case     :							Tuple	,	__snake_case     :							Optional[int]      )     -> List[Any]:





				'''simple docstring'''


				snake_case__      :Dict         =   ""
				for i in table:
								res += inp[i - 1]
				return res





def 					lowercase_ (    __snake_case     :							List[str]      )     -> int:





				'''simple docstring'''


				return data[1:] + data[0]





def 					lowercase_ (    __snake_case     :							int	,	__snake_case     :							Union[str, Any]      )     -> Union[str, Any]:





				'''simple docstring'''


				snake_case__      :Union[str, Any]         =   ""
				for i in range(len(__snake_case      )      ):
								if a[i] == b[i]:
												res += "0"
								else:
												res += "1"
				return res





def 					lowercase_ (    __snake_case     :							Optional[int]	,	__snake_case     :							Dict      )     -> Union[str, Any]:





				'''simple docstring'''


				snake_case__      :int         =   int("0b" + data[0] + data[-1]	,	2      )
				snake_case__      :Union[str, Any]         =   int("0b" + data[1:3]	,	2      )
				return bin(s[row][col]      )[2:]





def 					lowercase_ (    __snake_case     :							Dict	,	__snake_case     :							Optional[Any]	,	__snake_case     :							Dict	,	__snake_case     :							List[Any]	,	__snake_case     :							Optional[int]      )     -> List[str]:





				'''simple docstring'''


				snake_case__      :Tuple         =   message[:4]
				snake_case__      :int         =   message[4:]
				snake_case__      :int         =   apply_table(__snake_case	,	__snake_case      )
				snake_case__      :Union[str, Any]         =   xor(__snake_case	,	__snake_case      )
				snake_case__      :Tuple         =   apply_sbox(__snake_case	,	temp[:4]      )  # noqa: E741
				snake_case__      :List[str]         =   apply_sbox(__snake_case	,	temp[4:]      )
				snake_case__      :int         =   "0" * (2 - len(__snake_case      )) + l  # noqa: E741
				snake_case__      :int         =   "0" * (2 - len(__snake_case      )) + r
				snake_case__      :Optional[Any]         =   apply_table(l + r	,	__snake_case      )
				snake_case__      :Tuple         =   xor(__snake_case	,	__snake_case      )
				return temp + right


if __name__ == "__main__":
	__UpperCAmelCase							:   Dict							=  input("Enter 10 bit key: ")
	__UpperCAmelCase							:   Tuple							=  input("Enter 8 bit message: ")

	__UpperCAmelCase							:   Any							=  [6, 3, 7, 4, 8, 5, 1_0, 9]
	__UpperCAmelCase							:   List[str]							=  [3, 5, 2, 7, 4, 1_0, 1, 9, 8, 6]
	__UpperCAmelCase							:   Tuple							=  [2, 4, 3, 1]
	__UpperCAmelCase							:   List[Any]							=  [2, 6, 3, 1, 4, 8, 5, 7]
	__UpperCAmelCase							:   Optional[Any]							=  [4, 1, 3, 5, 7, 2, 8, 6]
	__UpperCAmelCase							:   Optional[int]							=  [4, 1, 2, 3, 2, 3, 4, 1]
	__UpperCAmelCase							:   List[Any]							=  [[1, 0, 3, 2], [3, 2, 1, 0], [0, 2, 1, 3], [3, 1, 3, 2]]
	__UpperCAmelCase							:   Union[str, Any]							=  [[0, 1, 2, 3], [2, 0, 1, 3], [3, 0, 1, 0], [2, 1, 0, 3]]

	# key generation
	__UpperCAmelCase							:   int							=  apply_table(key, paa_table)
	__UpperCAmelCase							:   Dict							=  temp[:5]
	__UpperCAmelCase							:   Optional[int]							=  temp[5:]
	__UpperCAmelCase							:   Optional[int]							=  left_shift(left)
	__UpperCAmelCase							:   Union[str, Any]							=  left_shift(right)
	__UpperCAmelCase							:   int							=  apply_table(left + right, pa_table)
	__UpperCAmelCase							:   Tuple							=  left_shift(left)
	__UpperCAmelCase							:   Union[str, Any]							=  left_shift(right)
	__UpperCAmelCase							:   Dict							=  left_shift(left)
	__UpperCAmelCase							:   Optional[Any]							=  left_shift(right)
	__UpperCAmelCase							:   Optional[int]							=  apply_table(left + right, pa_table)

	# encryption
	__UpperCAmelCase							:   Tuple							=  apply_table(message, IP)
	__UpperCAmelCase							:   Tuple							=  function(expansion, sa, sa, keya, temp)
	__UpperCAmelCase							:   List[Any]							=  temp[4:] + temp[:4]
	__UpperCAmelCase							:   int							=  function(expansion, sa, sa, keya, temp)
	__UpperCAmelCase							:   Union[str, Any]							=  apply_table(temp, IP_inv)
	print("Cipher text is:", CT)

	# decryption
	__UpperCAmelCase							:   List[Any]							=  apply_table(CT, IP)
	__UpperCAmelCase							:   List[Any]							=  function(expansion, sa, sa, keya, temp)
	__UpperCAmelCase							:   int							=  temp[4:] + temp[:4]
	__UpperCAmelCase							:   Union[str, Any]							=  function(expansion, sa, sa, keya, temp)
	__UpperCAmelCase							:   Union[str, Any]							=  apply_table(temp, IP_inv)
	print("Plain text after decypting is:", PT)