
'''simple docstring'''





import itertools

def   A			(							A_				:       List[str]							):
						return (
						    int(''''''.join(combination[0:2]							)							) * int(''''''.join(combination[2:5]							)							)
						    == int(''''''.join(combination[5:9]							)							)
						) or (
						    int(''''''.join(combination[0]							)							) * int(''''''.join(combination[1:5]							)							)
						    == int(''''''.join(combination[5:9]							)							)
						)

def   A			(							):
						return sum(
						    {
						        int(''''''.join(pandigital[5:9]							)							)
						        for pandigital in itertools.permutations('''123456789'''							)
						        if is_combination_valid(a_							)
						    }							)


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



"""simple docstring"""

def 						UpperCAmelCase   (						a_     ):





		'''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 						UpperCAmelCase   (						a_     ):





		'''simple docstring'''


		if not isinstance(a_,		a_     ):
				raise TypeError('dynamic_lucas_number accepts only integer arguments.'     )
		lowerCamelCase      ,       lowerCamelCase	:     Optional[int]            =       2, 1
		for _ in range(a_     ):
				lowerCamelCase      ,       lowerCamelCase	:     Optional[int]            =       b, a + b
		return a


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

					testmod()
					_A				=					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)))






