
'''simple docstring'''
def 					_UpperCamelCase		(    SCREAMING_SNAKE_CASE__ = 400_0000       )   ->				int:


		'''simple docstring'''


		if n <= 1:
				return 0
		snake_case   :    int			       =		0
		snake_case   :    int			       =		2
		snake_case   :    int			       =		0
		while 4 * b + a <= n:
				snake_case       ,snake_case   :    List[str]			       =		b, 4 * b + a
				count += a
		return count + b


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










from __future__ import annotations

def    lowerCAmelCase__		(			_a				:	list[int]     ,					_a				:	int			):
		snake_case_       ,				snake_case_ :							Tuple         =				0, len(_a			) - 1
		while start_ind <= end_ind:
				if array[start_ind] == search_item:
						return start_ind
				elif array[end_ind] == search_item:
						return end_ind
				else:
						start_ind += 1
						end_ind -= 1
    # returns -1 if search_item is not found in array
		return -1


if __name__ == "__main__":
							print(double_linear_search(list(range(1_00)), 40))
