code: 
  
  
  '''simple docstring'''
  
  lowerCAmelCase   :List[str]								=    [
      [0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0],
      [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0],
      [0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0],
      [0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0],
      [0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0],
      [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0],
      [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0],
      [0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0],
  ]
  
  
  
  
  
  def lowerCamelCase    (    lowerCAmelCase       :			int	,	lowerCAmelCase       :			int	,	lowerCAmelCase       :			int	,	lowerCAmelCase       :			int	):
  
  
  
  
  
  	"""simple docstring"""
  
  
  
  
  
  
  
  	return 0 <= row < rows and 0 <= col < cols
  
  
  
  
  
  def lowerCamelCase    (    lowerCAmelCase       :			int	,	lowerCAmelCase       :			int	,	lowerCAmelCase       :			set	,	lowerCAmelCase       :			list[list[int]]	):
  
  
  
  
  
  	"""simple docstring"""
  
  
  
  
  
  
  
  	__magic_name__ :					List[Any]  			=  len(lowerCAmelCase	)
  	__magic_name__ :					List[Any]  			=  len(mat[0]	)
  	if is_safe(lowerCAmelCase	,	lowerCAmelCase	,	lowerCAmelCase	,	lowerCAmelCase	) and (row, col) not in seen and mat[row][col] == 1:
  		seen.add((row, col)	)
  		return (
  		    1
  		    + depth_first_search(row + 1	,	lowerCAmelCase	,	lowerCAmelCase	,	lowerCAmelCase	)
  		    + depth_first_search(row - 1	,	lowerCAmelCase	,	lowerCAmelCase	,	lowerCAmelCase	)
  		    + depth_first_search(lowerCAmelCase	,	col + 1	,	lowerCAmelCase	,	lowerCAmelCase	)
  		    + depth_first_search(lowerCAmelCase	,	col - 1	,	lowerCAmelCase	,	lowerCAmelCase	)
  		)
  	else:
  		return 0
  
  
  
  
  
  def lowerCamelCase    (    lowerCAmelCase       :			list[list[int]]	):
  
  
  
  
  
  	"""simple docstring"""
  
  
  
  
  
  
  
  	__magic_name__ :					set  			=  set()
  
  	__magic_name__ :					Union[str, Any]  			=  0
  	for row, line in enumerate(lowerCAmelCase	):
  		for col, item in enumerate(lowerCAmelCase	):
  			if item == 1 and (row, col) not in seen:
  				# Maximizing the area
  				__magic_name__ :					Union[str, Any]  			=  max(lowerCAmelCase	,	depth_first_search(lowerCAmelCase	,	lowerCAmelCase	,	lowerCAmelCase	,	lowerCAmelCase	)	)
  	return max_area
  
  
  if __name__ == "__main__":
  							import doctest
  
  							print(find_max_area(matrix))  # Output -> 6
  							doctest.testmod()
style_context: 
  
  
  '''simple docstring'''
  
  from .number_theory.prime_numbers import next_prime
  class _lowerCamelCase :
  
  
  
  		'''simple docstring'''
  
  
  
  
  
  
  
  		def __init__(      self	:		Dict						,  _A	:		int						,  _A	:		int | None = None						,  _A	:		float | None = None						,  )						->				None:
  			__magic_name__ :					Optional[int]  			=  size_table
  			__magic_name__ :					int  			=  [None] * self.size_table
  			__magic_name__ :					int  			=  0.75 if lim_charge is None else lim_charge
  			__magic_name__ :					int  			=  1 if charge_factor is None else charge_factor
  			__magic_name__ :					list  			=  []
  			__magic_name__ :					dict  			=  {}
  
  
  
  
  
  
  
  		def      __lowerCAmelCase	(      self	:		List[str]    )						->				str:
  			return self._keys
  
  
  
  
  
  
  
  		def      __lowerCAmelCase	(      self	:		Dict    )						->				Optional[Any]:
  			return sum(1 for slot in self.values if slot is not None    ) / (
  			    self.size_table * self.charge_factor
  			)
  
  
  
  
  
  
  
  		def      __lowerCAmelCase	(      self	:		int						,  _A	:		int    )						->				List[Any]:
  			return key % self.size_table
  
  
  
  
  
  
  
  		def      __lowerCAmelCase	(      self	:		List[Any]						,  _A	:		Tuple    )						->				Optional[int]:
  			print(F'step {step_ord}'    )
  			print(list(range(len(self.values    )    )    )    )
  			print(self.values    )
  
  
  
  
  
  
  
  		def      __lowerCAmelCase	(      self	:		str						,  _A	:		Optional[Any]    )						->				Optional[int]:
  			__magic_name__ :					int  			=  1
  			__magic_name__ :					Optional[int]  			=  values
  			for value in values:
  				self.insert_data(_A    )
  				self._step_by_step(_A    )
  				i += 1
  
  
  
  
  
  
  
  		def      __lowerCAmelCase	(      self	:		List[Any]						,  _A	:		List[str]						,  _A	:		List[Any]    )						->				Dict:
  			__magic_name__ :					str  			=  data
  			__magic_name__ :					Optional[int]  			=  data
  
  
  
  
  
  
  
  		def      __lowerCAmelCase	(      self	:		Union[str, Any]						,  _A	:		List[Any]						,  _A	:		Union[str, Any]=None    )						->				int:
  			__magic_name__ :					int  			=  self.hash_function(key + 1    )
  
  			while self.values[new_key] is not None and self.values[new_key] != key:
  				if self.values.count(_A    ) > 0:
  					__magic_name__ :					Dict  			=  self.hash_function(new_key + 1    )
  				else:
  					__magic_name__ :					Tuple  			=  None
  					break
  
  			return new_key
  
  
  
  
  
  
  
  		def      __lowerCAmelCase	(      self	:		List[str]    )						->				Tuple:
  			__magic_name__ :					Dict  			=  [value for value in self.values if value is not None]
  			__magic_name__ :					int  			=  next_prime(self.size_table						,  factor=2    )
  			self._keys.clear()
  			__magic_name__ :					Tuple  			=  [None] * self.size_table  # hell's pointers D: don't DRY ;/
  			for value in survivor_values:
  				self.insert_data(_A    )
  
  
  
  
  
  
  
  		def      __lowerCAmelCase	(      self	:		Tuple						,  _A	:		Union[str, Any]    )						->				Tuple:
  			__magic_name__ :					Tuple  			=  self.hash_function(_A    )
  
  			if self.values[key] is None:
  				self._set_value(_A						,  _A    )
  
  			elif self.values[key] == data:
  				pass
  
  			else:
  				__magic_name__ :					str  			=  self._collision_resolution(_A						,  _A    )
  				if collision_resolution is not None:
  					self._set_value(_A						,  _A    )
  				else:
  					self.rehashing()
  					self.insert_data(_A    )