
class 					_SCREAMING_SNAKE_CASE  :  # Public class to implement a graph
      def __init__(			self		,	lowerCamelCase		,	lowerCamelCase		,	lowerCamelCase ):
          snake_case__						=				row
          snake_case__						=				col
          snake_case__						=				graph
      def A_			(			self		,	lowerCamelCase		,	lowerCamelCase		,	lowerCamelCase ):
          return (
              0 <= i < self.ROW
              and 0 <= j < self.COL
              and not visited[i][j]
              and self.graph[i][j]
          )
      def A_			(			self		,	lowerCamelCase		,	lowerCamelCase		,	lowerCamelCase ):
          # Checking all 8 elements surrounding nth element
          snake_case__						=				[-1, -1, -1, 0, 0, 1, 1, 1]  # Coordinate order
          snake_case__						=				[-1, 0, 1, -1, 1, -1, 0, 1]
          snake_case__						=				True  # Make those cells visited
          for k in range(8 ):
              if self.is_safe(i + row_nbr[k]		,	j + col_nbr[k]		,	lowerCamelCase ):
                  self.diffs(i + row_nbr[k]		,	j + col_nbr[k]		,	lowerCamelCase )



      def A_			(			self ):  # And finally, count all islands.
          snake_case__						=				[[False for j in range(self.COL )] for i in range(self.ROW )]
          snake_case__						=				0
          for i in range(self.ROW ):
              for j in range(self.COL ):
                  if visited[i][j] is False and self.graph[i][j] == 1:
                      self.diffs(lowerCamelCase		,	lowerCamelCase		,	lowerCamelCase )
                      count += 1
          return count





from __future__ import annotations





def 	SCREAMING_SNAKE_CASE__    (      __lowerCAmelCase    ,		__lowerCAmelCase							):
    if len(__lowerCAmelCase							) == 0:
        return False
    snake_case__						=				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__":
     __magic_name__            =  input('''Enter numbers separated by comma:\n''').strip()
     __magic_name__            =  [int(item.strip()) for item in user_input.split(''',''')]
     __magic_name__            =  int(input('''Enter the number to be found in the list:\n''').strip())
     __magic_name__            =  '''''' if binary_search(sequence, target) else '''not '''
     print(F'''{target} was {not_str}found in {sequence}''')



