
'''simple docstring'''





def 	snake_case_							(				_a  :				str			,       _a  :				int = 13      ):
      snake_case_    							=				""
      for c in s:
            if "A" <= c <= "Z":
                  out += chr(ord("A"      ) + (ord(_a      ) - ord("A"      ) + n) % 26      )
            elif "a" <= c <= "z":
                  out += chr(ord("a"      ) + (ord(_a      ) - ord("a"      ) + n) % 26      )
            else:
                  out += c
      return out
def 	snake_case_							(				):
      snake_case_    							=				input("Enter message: "      )

      snake_case_    							=				dencrypt(_a			,       13      )
      print("Encryption:"			,       _a      )

      snake_case_    							=				dencrypt(_a			,       13      )
      print("Decryption: "			,       _a      )


if __name__ == "__main__":
     import doctest

     doctest.testmod()
     main()



'''simple docstring'''





from collections import Counter
from functools import total_ordering

from data_structures.heap.heap import Heap



@total_ordering
class 			lowerCAmelCase__ :



  '''simple docstring'''






  def __init__(self	:			Tuple						,			lowerCAmelCase_	:			str						,			lowerCAmelCase_	:			int     ) ->							None:
        snake_case_    							=				word
        snake_case_    							=				count

  def __eq__(self	:			List[Any]						,			lowerCAmelCase_	:			object     ) ->							bool:
        if not isinstance(lowerCAmelCase_						,			lowerCAmelCase_     ):
              return NotImplemented
        return self.count == other.count


  def __lt__(self	:			Tuple						,			lowerCAmelCase_	:			object     ) ->							bool:
        if not isinstance(lowerCAmelCase_						,			lowerCAmelCase_     ):
              return NotImplemented
        return self.count < other.count

def 	snake_case_							(				_a  :				list[str]			,       _a  :				int      ):
      snake_case_    							=				Heap()
      snake_case_    							=				Counter(_a      )
      heap.build_max_heap(
          [WordCount(_a			,       _a      ) for word, count in count_by_word.items()]      )
      return [heap.extract_max().word for _ in range(min(_a			,       len(_a      )      )      )]


if __name__ == "__main__":
     import doctest

     doctest.testmod()

