
def 				A__    (  lowerCamelCase   ,			lowerCamelCase  )     ->		List[Any]:
				sequence.append(lowerCamelCase  )

				UpperCamelCase_:							Optional[int]		=  0
				while sequence[index] != target:
								index += 1

				sequence.pop()

				if index == len(lowerCamelCase  ):
								return None

				return index


if __name__ == "__main__":
							lowerCamelCase_  :       str					      =     input("""Enter numbers separated by comma:\n""").strip()
							lowerCamelCase_  :       int					      =     [int(item) for item in user_input.split(""",""")]

							lowerCamelCase_  :       Dict					      =     input("""Enter a single number to be found in the list:\n""")
							lowerCamelCase_  :       Union[str, Any]					      =     int(target_input)
							lowerCamelCase_  :       Tuple					      =     sentinel_linear_search(sequence, target)
							if result is not None:
														print(F"""{target} found at positions: {result}""")
							else:
														print("""Not found""")








"""simple docstring"""


import itertools



def     _lowerCamelCase(__UpperCamelCase       )				-> 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     _lowerCamelCase()				-> Dict:
	return sum(
	    {
	        int("""""".join(pandigital[5:9]       )       )
	        for pandigital in itertools.permutations("""123456789"""       )
	        if is_combination_valid(__UpperCamelCase       )
	    }       )


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



