def 							lowerCAmelCase(	__lowerCamelCase = 400_0000						):

					if n <= 1:
										return 0
					__a							=   0
					__a							=   2
					__a							=   0
					while 4 * b + a <= n:
										__a					,      __a							=   b, 4 * b + a
										count += a
					return count + b


if __name__ == "__main__":
	print(F'''{solution() = }''')





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""")




