

"""simple docstring"""




def       snake_case__    (       lowerCAmelCase_,   lowerCAmelCase_      ):





     """simple docstring"""







     if not isinstance(lowerCAmelCase_,   lowerCAmelCase_      ):
          raise TypeError('plaintext must be a string'      )
     if not isinstance(lowerCAmelCase_,   lowerCAmelCase_      ):
          raise TypeError('key must be a string'      )

     if not plaintext:
          raise ValueError('plaintext is empty'      )
     if not key:
          raise ValueError('key is empty'      )

     key += plaintext
     SCREAMING_SNAKE_CASE										=plaintext.lower()
     SCREAMING_SNAKE_CASE										=key.lower()
     SCREAMING_SNAKE_CASE										=0
     SCREAMING_SNAKE_CASE										=0
     SCREAMING_SNAKE_CASE										=''
     while plaintext_iterator < len(lowerCAmelCase_      ):
          if (
              ord(plaintext[plaintext_iterator]      ) < 97
              or ord(plaintext[plaintext_iterator]      ) > 122
          ):
               ciphertext += plaintext[plaintext_iterator]
               plaintext_iterator += 1
          elif ord(key[key_iterator]      ) < 97 or ord(key[key_iterator]      ) > 122:
               key_iterator += 1
          else:
               ciphertext += chr(
                   (
                       (ord(plaintext[plaintext_iterator]      ) - 97 + ord(key[key_iterator]      ))
                       - 97
                   )
                   % 26
                   + 97      )
               key_iterator += 1
               plaintext_iterator += 1
     return ciphertext







def       snake_case__    (       lowerCAmelCase_,   lowerCAmelCase_      ):





     """simple docstring"""







     if not isinstance(lowerCAmelCase_,   lowerCAmelCase_      ):
          raise TypeError('ciphertext must be a string'      )
     if not isinstance(lowerCAmelCase_,   lowerCAmelCase_      ):
          raise TypeError('key must be a string'      )

     if not ciphertext:
          raise ValueError('ciphertext is empty'      )
     if not key:
          raise ValueError('key is empty'      )

     SCREAMING_SNAKE_CASE										=key.lower()
     SCREAMING_SNAKE_CASE										=0
     SCREAMING_SNAKE_CASE										=0
     SCREAMING_SNAKE_CASE										=''
     while ciphertext_iterator < len(lowerCAmelCase_      ):
          if (
              ord(ciphertext[ciphertext_iterator]      ) < 97
              or ord(ciphertext[ciphertext_iterator]      ) > 122
          ):
               plaintext += ciphertext[ciphertext_iterator]
          else:
               plaintext += chr(
                   (ord(ciphertext[ciphertext_iterator]      ) - ord(key[key_iterator]      )) % 26
                   + 97      )
               key += chr(
                   (ord(ciphertext[ciphertext_iterator]      ) - ord(key[key_iterator]      )) % 26
                   + 97      )
               key_iterator += 1
          ciphertext_iterator += 1
     return plaintext


if __name__ == "__main__":
 import doctest

 doctest.testmod()
 _lowerCamelCase								=int(input("Type 1 to encrypt or 2 to decrypt:"))
 if operation == 1:
  _lowerCamelCase								=input("Typeplaintext to be encrypted:\n")
  _lowerCamelCase								=input("Type the key:\n")
  print(encrypt(plaintext, key))
 elif operation == 2:
  _lowerCamelCase								=input("Type the ciphertext to be decrypted:\n")
  _lowerCamelCase								=input("Type the key:\n")
  print(decrypt(ciphertext, key))
 decrypt("jsqqs avvwo", "coffee")




def       snake_case__    (       lowerCAmelCase_      ):





     """simple docstring"""







     SCREAMING_SNAKE_CASE										=len(lowerCAmelCase_      )
     for _ in range(
         0,   int(((no_of_elements - 1) / 2) + 1      )      ):  # we don't need to traverse to end of list as
          for j in range(0,   no_of_elements - 1      ):
               if (
                   lst[j + 1] < lst[j]
               ):  # applying bubble sort algorithm from left to right (or forwards)
                    SCREAMING_SNAKE_CASE										=lst[j + 1]
                    SCREAMING_SNAKE_CASE										=lst[j]
                    SCREAMING_SNAKE_CASE										=temp
               if (
                   lst[no_of_elements - 1 - j] < lst[no_of_elements - 2 - j]
               ):  # applying bubble sort algorithm from right to left (or backwards)
                    SCREAMING_SNAKE_CASE										=lst[no_of_elements - 1 - j]
                    SCREAMING_SNAKE_CASE										=lst[no_of_elements - 2 - j]
                    SCREAMING_SNAKE_CASE										=temp
     return lst


if __name__ == "__main__":
 print("enter the list to be sorted")
 _lowerCamelCase								=[int(x) for x in input().split()]  # inputing elements of the list in one line
 _lowerCamelCase								=double_sort(lst)
 print("the sorted list is")
 print(sorted_lst)

