def 							lowerCAmelCase(	__lowerCamelCase      ,				__lowerCamelCase						):
					sequence.append(__lowerCamelCase						)

					__a							=   0
					while sequence[index] != target:
										index += 1

					sequence.pop()

					if index == len(__lowerCamelCase						):
										return None

					return index


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

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





def 							lowerCAmelCase(	__lowerCamelCase = 10**6						):

					if n <= 0:
										raise ValueError('Please enter an integer greater than 0'						)

					__a							=   list(range(n + 1						)						)
					for number in range(2      ,				n + 1						):
										if phi[number] == number:
															phi[number] -= 1
															for multiple in range(number * 2      ,				n + 1      ,				__lowerCamelCase						):
																				__a							=   (phi[multiple] // number) * (number - 1)

					__a							=   1
					for number in range(1      ,				n + 1						):
										if (answer / phi[answer]) < (number / phi[number]):
															__a							=   number

					return answer


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




