code: from __future__ import annotations
  
  
  def SCREAMING_SNAKE_CASE				(     lowercase_:	int		,						lowercase_:	int		,						lowercase_:	int				):
         assert (
             c % greatest_common_divisor(lowercase_		,						lowercase_				) == 0
         )  # greatest_common_divisor(a,b) function implemented below
         ((_UpperCamelCase)						,      (_UpperCamelCase)						,      (_UpperCamelCase))     :       int  						=  extended_gcd(lowercase_		,						lowercase_				)  # extended_gcd(a,b) function implemented below
         _UpperCamelCase     :       List[Any]  						=  c / d
         return (r * x, r * y)
  
  
  def SCREAMING_SNAKE_CASE				(     lowercase_:	int		,						lowercase_:	int		,						lowercase_:	int		,						lowercase_:	int = 2				):
         ((_UpperCamelCase)						,      (_UpperCamelCase))     :       Tuple  						=  diophantine(lowercase_		,						lowercase_		,						lowercase_				)  # Initial value
         _UpperCamelCase     :       List[Any]  						=  greatest_common_divisor(lowercase_		,						lowercase_				)
         _UpperCamelCase     :       Optional[int]  						=  a // d
         _UpperCamelCase     :       Optional[Any]  						=  b // d
  
         for i in range(lowercase_				):
                _UpperCamelCase     :       Union[str, Any]  						=  xa + i * q
                _UpperCamelCase     :       List[Any]  						=  ya - i * p
                print(lowercase_		,						lowercase_				)
  
  
  def SCREAMING_SNAKE_CASE				(     lowercase_:	int		,						lowercase_:	int				):
         if a < b:
                _UpperCamelCase						,      _UpperCamelCase     :       Optional[Any]  						=  b, a
  
         while a % b != 0:
                _UpperCamelCase						,      _UpperCamelCase     :       Union[str, Any]  						=  b, a % b
  
         return b
  
  
  def SCREAMING_SNAKE_CASE				(     lowercase_:	int		,						lowercase_:	int				):
         assert a >= 0 and b >= 0
  
         if b == 0:
                _UpperCamelCase						,      _UpperCamelCase						,      _UpperCamelCase     :       Optional[Any]  						=  a, 1, 0
         else:
                ((_UpperCamelCase)						,      (_UpperCamelCase)						,      (_UpperCamelCase))     :       Any  						=  extended_gcd(lowercase_		,						a % b				)
                _UpperCamelCase     :       Any  						=  q
                _UpperCamelCase     :       str  						=  p - q * (a // b)
  
         assert a % d == 0 and b % d == 0
         assert d == a * x + b * y
  
         return (d, x, y)
  
  
  if __name__ == "__main__":
   from doctest import testmod
  
   testmod(name='''diophantine''', verbose=True)
   testmod(name='''diophantine_all_soln''', verbose=True)
   testmod(name='''extended_gcd''', verbose=True)
   testmod(name='''greatest_common_divisor''', verbose=True)
  
  
  
  
style_context: UpperCAmelCase					=				[chr(i) for i in range(32, 1_26)]
  UpperCAmelCase					=				list(range(len(alphabets)))
  UpperCAmelCase					=				list(range(len(alphabets)))
  UpperCAmelCase					=				list(range(len(alphabets)))
  UpperCAmelCase					=				list(reversed(range(len(alphabets))))
  UpperCAmelCase					=				[]
  UpperCAmelCase					=				UpperCAmelCase					=				UpperCAmelCase					=				0
  
  
  def SCREAMING_SNAKE_CASE				(     ):
         global gear_one_pos
         global gear_two_pos
         global gear_three_pos
         _UpperCamelCase     :       Any  						=  gear_one[0]
         gear_one.append(lowercase_				)
         del gear_one[0]
         gear_one_pos += 1
         if gear_one_pos % int(len(lowercase_				)				) == 0:
                _UpperCamelCase     :       str  						=  gear_two[0]
                gear_two.append(lowercase_				)
                del gear_two[0]
                gear_two_pos += 1
                if gear_two_pos % int(len(lowercase_				)				) == 0:
                       _UpperCamelCase     :       int  						=  gear_three[0]
                       gear_three.append(lowercase_				)
                       del gear_three[0]
                       gear_three_pos += 1
  
  
  def SCREAMING_SNAKE_CASE				(     lowercase_:	List[Any]				):
         _UpperCamelCase     :       Dict  						=  alphabets.index(lowercase_				)
         _UpperCamelCase     :       Union[str, Any]  						=  gear_one[target]
         _UpperCamelCase     :       Any  						=  gear_two[target]
         _UpperCamelCase     :       Tuple  						=  gear_three[target]
         _UpperCamelCase     :       Tuple  						=  reflector[target]
         _UpperCamelCase     :       Any  						=  gear_three.index(lowercase_				)
         _UpperCamelCase     :       Any  						=  gear_two.index(lowercase_				)
         _UpperCamelCase     :       str  						=  gear_one.index(lowercase_				)
         code.append(alphabets[target]				)
         rotator()
  
  
  if __name__ == "__main__":
   UpperCAmelCase					=				list(input('''Type your message:\n'''))
   while True:
    try:
     UpperCAmelCase					=				int(input('''Please set token:(must be only digits)\n'''))
     break
    except Exception as error:
     print(error)
   for _ in range(token):
    rotator()
   for j in decode:
    engine(j)
   print('''\n''' + ''''''.join(code))
   print(
       f'''\nYour Token is {token} please write it down.\nIf you want to decode '''
       '''this message again you should input same digits as token!'''
   )
  
  
  
  