



A__						:						Any          =      [
    [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     UpperCamelCase(						__UpperCamelCase							:	int  ,__UpperCamelCase							:	int  ,__UpperCamelCase							:	int  ,__UpperCamelCase							:	int				):
		return 0 <= row < rows and 0 <= col < cols


def     UpperCamelCase(						__UpperCamelCase							:	int  ,__UpperCamelCase							:	int  ,__UpperCamelCase							:	set  ,__UpperCamelCase							:	list[list[int]]				):
		lowerCAmelCase_    :  str             =				len(__UpperCamelCase				)
		lowerCAmelCase_    :  List[str]             =				len(mat[0]				)
		if is_safe(__UpperCamelCase  ,__UpperCamelCase  ,__UpperCamelCase  ,__UpperCamelCase				) and (row, col) not in seen and mat[row][col] == 1:
				seen.add((row, col)				)
				return (
				    1
				    + depth_first_search(row + 1  ,__UpperCamelCase  ,__UpperCamelCase  ,__UpperCamelCase				)
				    + depth_first_search(row - 1  ,__UpperCamelCase  ,__UpperCamelCase  ,__UpperCamelCase				)
				    + depth_first_search(__UpperCamelCase  ,col + 1  ,__UpperCamelCase  ,__UpperCamelCase				)
				    + depth_first_search(__UpperCamelCase  ,col - 1  ,__UpperCamelCase  ,__UpperCamelCase				)
				)
		else:
				return 0


def     UpperCamelCase(						__UpperCamelCase							:	list[list[int]]				):
		lowerCAmelCase_    :  set             =				set()

		lowerCAmelCase_    :  Dict             =				0
		for row, line in enumerate(__UpperCamelCase				):
				for col, item in enumerate(__UpperCamelCase				):
						if item == 1 and (row, col) not in seen:
								# Maximizing the area
								lowerCAmelCase_    :  Any             =				max(__UpperCamelCase  ,depth_first_search(__UpperCamelCase  ,__UpperCamelCase  ,__UpperCamelCase  ,__UpperCamelCase				)				)
		return max_area


if __name__ == "__main__":
						import doctest

						print(find_max_area(matrix))  # Output -> 6
						doctest.testmod()










from __future__ import annotations

from typing import Generic, TypeVar

A__						:						Dict          =      TypeVar('''T''')



class        __snake_case		(  Generic[T]		):




							def __init__( self  : List[Any]       ,       A_  : T):
									lowerCAmelCase_    :  Optional[Any]             =				data  # Assign data
									lowerCAmelCase_    :  Node[T] | None             =				None  # Initialize next as null
									lowerCAmelCase_    :  Node[T] | None             =				None  # Initialize prev as null





class        __snake_case		(  Generic[T]		):




							def __init__( self  : Union[str, Any]):
									lowerCAmelCase_    :  Node[T] | None             =				None




							def      UpperCAmelCase__    ( self  : List[str]       ,       A_  : T):
									if self.head is None:
											lowerCAmelCase_    :  List[Any]             =				Node(A_)
									else:
											lowerCAmelCase_    :  Tuple             =				Node(A_)
											lowerCAmelCase_    :  Optional[int]             =				new_node
											lowerCAmelCase_    :  Optional[int]             =				self.head
											lowerCAmelCase_    :  Optional[Any]             =				None
											lowerCAmelCase_    :  Dict             =				new_node




							def      UpperCAmelCase__    ( self  : List[str]):
									if self.head is None:
											return None
									else:
											assert self.head is not None
											lowerCAmelCase_    :  Tuple             =				self.head.data
											lowerCAmelCase_    :  Any             =				self.head.next
											if self.head is not None:
													lowerCAmelCase_    :  Optional[Any]             =				None
											return temp




							def      UpperCAmelCase__    ( self  : Union[str, Any]):
									return self.head.data if self.head is not None else None




							def __len__( self  : Dict):
									lowerCAmelCase_    :  List[str]             =				self.head
									lowerCAmelCase_    :  str             =				0
									while temp is not None:
											count += 1
											lowerCAmelCase_    :  Union[str, Any]             =				temp.next
									return count




							def      UpperCAmelCase__    ( self  : Dict):
									return self.head is None







							def      UpperCAmelCase__    ( self  : Dict):
									print('''stack elements are:''')
									lowerCAmelCase_    :  Optional[Any]             =				self.head
									while temp is not None:
											print(temp.data       ,       end='''->''')
											lowerCAmelCase_    :  List[str]             =				temp.next


# Code execution starts here
if __name__ == "__main__":
						# Start with the empty stack
						A__						:						Stack[int]          =      Stack()

						# Insert 4 at the beginning. So stack becomes 4->None
						print('''Stack operations using Doubly LinkedList''')
						stack.push(4)

						# Insert 5 at the beginning. So stack becomes 4->5->None
						stack.push(5)

						# Insert 6 at the beginning. So stack becomes 4->5->6->None
						stack.push(6)

						# Insert 7 at the beginning. So stack becomes 4->5->6->7->None
						stack.push(7)

						# Print the stack
						stack.print_stack()

						# Print the top element
						print('''\nTop element is ''', stack.top())

						# Print the stack size
						print('''Size of the stack is ''', len(stack))

						# pop the top element
						stack.pop()

						# pop the top element
						stack.pop()

						# two elements have now been popped off
						stack.print_stack()

						# Print True if the stack is empty else False
						print('''\nstack is empty:''', stack.is_empty())





