"""simple docstring"""







import numpy as np

lowerCamelCase      : Union[str, Any]       =[
    ['''a''', '''b''', '''c''', '''d''', '''e'''],
    ['''f''', '''g''', '''h''', '''i''', '''k'''],
    ['''l''', '''m''', '''n''', '''o''', '''p'''],
    ['''q''', '''r''', '''s''', '''t''', '''u'''],
    ['''v''', '''w''', '''x''', '''y''', '''z'''],
]






class 							__snake_case:


    '''simple docstring'''





    def __init__(  self	):




         '''simple docstring'''



         __A					:					Dict								=		np.array(__lowerCamelCase	)
    def 						_a							(  self					,       __lowerCamelCase	):




         '''simple docstring'''



         __A						,		__A					:					Any								=		np.where(letter == self.SQUARE	)
         __A					:					List[str]								=		np.concatenate([indexa + 1, indexa + 1]	)
         return indexes
    def 						_a							(  self					,       __lowerCamelCase					,       __lowerCamelCase	):




         '''simple docstring'''



         return self.SQUARE[indexa - 1, indexa - 1]
    def 						_a							(  self					,       __lowerCamelCase	):




         '''simple docstring'''



         __A					:					List[Any]								=		message.lower()
         __A					:					Optional[Any]								=		message.replace('j'					,       'i'	)

         __A					:					Union[str, Any]								=		''
         for letter_index in range(len(__lowerCamelCase	)	):
              if message[letter_index] != " ":
                   __A					:					Dict								=		self.letter_to_numbers(message[letter_index]	)
                   __A					:					Dict								=		encoded_message + str(numbers[0]	) + str(numbers[1]	)
              elif message[letter_index] == " ":
                   __A					:					Dict								=		encoded_message + ' '

         return encoded_message

    def 						_a							(  self					,       __lowerCamelCase	):




         '''simple docstring'''



         __A					:					int								=		message.replace(' '					,       '  '	)
         __A					:					int								=		''
         for numbers_index in range(int(len(__lowerCamelCase	) / 2	)	):
              if message[numbers_index * 2] != " ":
                   __A					:					Union[str, Any]								=		message[numbers_index * 2]
                   __A					:					int								=		message[numbers_index * 2 + 1]

                   __A					:					Any								=		self.numbers_to_letter(int(__lowerCamelCase	)					,       int(__lowerCamelCase	)	)
                   __A					:					List[Any]								=		decoded_message + letter
              elif message[numbers_index * 2] == " ":
                   __A					:					List[str]								=		decoded_message + ' '

         return decoded_message




"""simple docstring"""







def 						_lowercase				(  _SCREAMING_SNAKE_CASE				:				list[int]						)    ->     tuple[int, int]:







     '''simple docstring'''


     if len(_SCREAMING_SNAKE_CASE						) == 1:
          return a[0], a[0]
     else:
          # split A into half.
          __A					:					List[str]								=		a[: len(_SCREAMING_SNAKE_CASE						) // 2]
          __A					:					Optional[Any]								=		a[len(_SCREAMING_SNAKE_CASE						) // 2 :]

          # 2 sub problems, 1/2 of original size.
          __A						,		__A					:					int								=		max_difference(_SCREAMING_SNAKE_CASE						)
          __A						,		__A					:					str								=		max_difference(_SCREAMING_SNAKE_CASE						)

          # get min of first and max of second
          # linear time
          __A					:					str								=		min(_SCREAMING_SNAKE_CASE						)
          __A					:					Optional[int]								=		max(_SCREAMING_SNAKE_CASE						)

          # 3 cases, either (small1, big1),
          # (min_first, max_second), (small2, big2)
          # constant comparisons
          if biga - smalla > max_second - min_first and biga - smalla > biga - smalla:
               return smalla, biga
          elif biga - smalla > max_second - min_first:
               return smalla, biga
          else:
               return min_first, max_second


if __name__ == "__main__":
       import doctest

       doctest.testmod()



