






import numpy as np

UpperCAmelCase__            =	[
    ["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 	lowercase_      :






      '''simple docstring'''




      def __init__(   self   :		Optional[Any]						)					->None:




       """simple docstring"""


       a							=   np.array(__UpperCAmelCase						)







      def    __lowerCAmelCase      (   self   :		List[str]				,      __UpperCAmelCase   :		str						)					->np.ndarray:




       """simple docstring"""


       a						,  a							=   np.where(letter == self.SQUARE						)
       a							=   np.concatenate([indexa + 1, indexa + 1]						)
       return indexes







      def    __lowerCAmelCase      (   self   :		int				,      __UpperCAmelCase   :		int				,      __UpperCAmelCase   :		int						)					->str:




       """simple docstring"""


       return self.SQUARE[indexa - 1, indexa - 1]







      def    __lowerCAmelCase      (   self   :		Tuple				,      __UpperCAmelCase   :		str						)					->str:




       """simple docstring"""


       a							=   message.lower()
       a							=   message.replace('''j'''				,      '''i'''						)

       a							=   ''''''
       for letter_index in range(len(__UpperCAmelCase						)						):
        if message[letter_index] != " ":
         a							=   self.letter_to_numbers(message[letter_index]						)
         a							=   encoded_message + str(numbers[0]						) + str(numbers[1]						)
        elif message[letter_index] == " ":
         a							=   encoded_message + ''' '''

       return encoded_message







      def    __lowerCAmelCase      (   self   :		Any				,      __UpperCAmelCase   :		str						)					->str:




       """simple docstring"""


       a							=   message.replace(''' '''				,      '''  '''						)
       a							=   ''''''
       for numbers_index in range(int(len(__UpperCAmelCase						) / 2						)						):
        if message[numbers_index * 2] != " ":
         a							=   message[numbers_index * 2]
         a							=   message[numbers_index * 2 + 1]

         a							=   self.numbers_to_letter(int(__UpperCAmelCase						)				,      int(__UpperCAmelCase						)						)
         a							=   decoded_message + letter
        elif message[numbers_index * 2] == " ":
         a							=   decoded_message + ''' '''

       return decoded_message










def 		_a					(   a				:int				)							->    int:
 if not isinstance(a			,							a				):
  raise TypeError('''recursive_lucas_number accepts only integer arguments.'''				)
 if n_th_number == 0:
  return 2
 if n_th_number == 1:
  return 1

 return recursive_lucas_number(n_th_number - 1				) + recursive_lucas_number(
     n_th_number - 2				)
def 		_a					(   a				:int				)							->    int:
 if not isinstance(a			,							a				):
  raise TypeError('''dynamic_lucas_number accepts only integer arguments.'''				)
 a						,  a							=   2, 1
 for _ in range(a				):
  a						,  a							=   b, a + b
 return a


if __name__ == "__main__":
     from doctest import testmod

     testmod()
     UpperCAmelCase__            =	int(input("Enter the number of terms in lucas series:\n").strip())
     print("Using recursive function to calculate lucas series:")
     print(" ".join(str(recursive_lucas_number(i)) for i in range(n)))
     print("\nUsing dynamic function to calculate lucas series:")
     print(" ".join(str(dynamic_lucas_number(i)) for i in range(n)))


