


"""simple docstring"""






def    A_ ( _lowerCAmelCase  :       int							):






     """simple docstring"""

     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_ ( _lowerCAmelCase  :       int							):






     """simple docstring"""

     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()
   __snake_case												=							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)))


from math import factorial




def        __UpperCamelCase     (      _A					:							Union[str, Any]      ,  _A					:							Tuple		)				->Any:



							"""simple docstring"""
							return factorial(_A		) / (factorial(_A		) * factorial(n - r		))




def        __UpperCamelCase     (      )				->Any:



							"""simple docstring"""
							lowerCamelCase_								=0

							for i in range(1      ,  101		):
														for j in range(1      ,  i + 1		):
																					if combinations(_A      ,  _A		) > 1E6:
																												total += 1
							return total


if __name__ == "__main__":
	print(solution())
