






def    lowerCAmelCase__		(			_a				:	int			):
		snake_case_ :							Optional[int]         =				[True for i in range(n + 1			)]
		snake_case_ :							List[str]         =				[i - 1 for i in range(n + 1			)]
		snake_case_ :							str         =				[]
		for i in range(2     ,					n + 1			):
				if is_prime[i]:
						primes.append(_a			)
				for j in range(0     ,					len(_a			)			):
						if i * primes[j] >= n:
								break
						snake_case_ :							List[Any]         =				False

						if i % primes[j] == 0:
								snake_case_ :							str         =				totients[i] * primes[j]
								break

						snake_case_ :							Tuple         =				totients[i] * (primes[j] - 1)

		return totients


if __name__ == "__main__":
							import doctest

							doctest.testmod()








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