



"""simple docstring"""







from __future__ import annotations

def   lowerCAmelCase__			(     lowerCamelCase__				,      lowerCamelCase__			) ->							bool:
							if len(lowerCamelCase__			) == 0:
														return False
							A         =					len(lowerCamelCase__			) // 2
							if a_list[midpoint] == item:
														return True
							if item < a_list[midpoint]:
														return binary_search(a_list[:midpoint]				,      lowerCamelCase__			)
							else:
														return binary_search(a_list[midpoint + 1 :]				,      lowerCamelCase__			)


if __name__ == "__main__":
							A    =			input('Enter numbers separated by comma:\n').strip()
							A    =			[int(item.strip()) for item in user_input.split(',')]
							A    =			int(input('Enter the number to be found in the list:\n').strip())
							A    =			'' if binary_search(sequence, target) else 'not '
							print(F'{target} was {not_str}found in {sequence}')








"""simple docstring"""







from __future__ import annotations

import sys
from collections import deque
from typing import Generic, TypeVar

A    =			TypeVar('T')






class      UpperCAmelCase__		(      Generic[T]     ):
		lowerCAmelCase_       :	deque[T]  # Cache store of keys
		lowerCAmelCase_       :	set[T]  # References of the keys in cache
		lowerCAmelCase_       :	int 							=     10  # Maximum capacity of cache



		def __init__( self  :    int      ,							snake_case  :    int				)			->						None:






									'''simple docstring'''

									A         =					deque()
									A         =					set()
									if not n:
																A         =					sys.maxsize
									elif n < 0:
																raise ValueError('n should be an integer greater than 0.'				)
									else:
																A         =					n



		def 					A_		( self  :    Optional[Any]      ,							snake_case  :    T				)			->						None:






									'''simple docstring'''

									if x not in self.key_reference:
																if len(self.dq_store				) == LRUCache._MAX_CAPACITY:
																							A         =					self.dq_store.pop()
																							self.key_reference.remove(snake_case				)
									else:
																self.dq_store.remove(snake_case				)

									self.dq_store.appendleft(snake_case				)
									self.key_reference.add(snake_case				)



		def 					A_		( self  :    Dict				)			->						None:






									'''simple docstring'''

									for k in self.dq_store:
																print(snake_case				)



		def __repr__( self  :    int				)			->						str:






									'''simple docstring'''

									return f"""LRUCache({self._MAX_CAPACITY}) => {list(self.dq_store				)}"""


if __name__ == "__main__":
							import doctest

							doctest.testmod()

							A    =			LRUCache(4)
							lru_cache.refer('A')
							lru_cache.refer(2)
							lru_cache.refer(3)
							lru_cache.refer('A')
							lru_cache.refer(4)
							lru_cache.refer(5)
							lru_cache.display()

							print(lru_cache)
							assert str(lru_cache) == "LRUCache(4) => [5, 4, 'A', 3]"



