





def lowerCAmelCase__(__snake_case	,__snake_case							)    ->				str:







	'''simple docstring'''







	sequence.append(__snake_case							)

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

	sequence.pop()

	if index == len(__snake_case							):
		return None

	return index


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

			_a									=				input("Enter a single number to be found in the list:\n")
			_a									=				int(target_input)
			_a									=				sentinel_linear_search(sequence, target)
			if result is not None:
						print(f"""{target} found at positions: {result}""")
			else:
						print("Not found")










import os





def lowerCAmelCase__()    ->				Optional[Any]:







	'''simple docstring'''







	lowerCamelCase__        =		os.path.dirname(os.path.realpath(__snake_case							)							)
	lowerCamelCase__        =		os.path.join(__snake_case	,'''triangle.txt'''							)

	with open(__snake_case							) as f:
		lowerCamelCase__        =		f.readlines()

	lowerCamelCase__        =		[[int(__snake_case							) for y in x.rstrip('''\r\n'''							).split(''' '''							)] for x in triangle]

	for i in range(1	,len(__snake_case							)							):
		for j in range(len(a[i]							)							):
			lowerCamelCase__        =		a[i - 1][j] if j != len(a[i - 1]							) else 0
			lowerCamelCase__        =		a[i - 1][j - 1] if j > 0 else 0
			a[i][j] += max(__snake_case	,__snake_case							)
	return max(a[-1]							)


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



