
'''simple docstring'''





UpperCAmelCase            = [
    [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   A			(							A_				:       int     ,				A_				:       int     ,				A_				:       int     ,				A_				:       int							):
						return 0 <= row < rows and 0 <= col < cols

def   A			(							A_				:       int     ,				A_				:       int     ,				A_				:       set     ,				A_				:       list[list[int]]							):
						snake_case							:  int			=     len(A_							)
						snake_case							:  List[Any]			=     len(mat[0]							)
						if is_safe(A_     ,				A_     ,				A_     ,				A_							) and (row, col) not in seen and mat[row][col] == 1:
												seen.add((row, col)							)
												return (
												    1
												    + depth_first_search(row + 1     ,				A_     ,				A_     ,				A_							)
												    + depth_first_search(row - 1     ,				A_     ,				A_     ,				A_							)
												    + depth_first_search(A_     ,				col + 1     ,				A_     ,				A_							)
												    + depth_first_search(A_     ,				col - 1     ,				A_     ,				A_							)
												)
						else:
												return 0

def   A			(							A_				:       list[list[int]]							):
						snake_case							:  set			=     set()

						snake_case							:  List[Any]			=     0
						for row, line in enumerate(A_							):
												for col, item in enumerate(A_							):
																		if item == 1 and (row, col) not in seen:
																								# Maximizing the area
																								snake_case							:  Union[str, Any]			=     max(A_     ,				depth_first_search(A_     ,				A_     ,				A_     ,				A_							)							)
						return max_area


if __name__ == "__main__":
						import doctest

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



'''simple docstring'''





import math
from timeit import timeit

def   A			(							A_				:       int							):
						snake_case							:  List[str]			=     0
						snake_case							:  Any			=     abs(A_							)
						while True:
												snake_case							:  List[Any]			=     n // 10
												digits += 1
												if n == 0:
																		break
						return digits

def   A			(							A_				:       int							):
						return 1 if n == 0 else math.floor(math.log(abs(A_							)     ,				10							) + 1							)

def   A			(							A_				:       int							):
						return len(str(abs(A_							)							)							)

def   A			(							):
						from collections.abc import Callable

						def benchmark_a_function(A_				:       Callable     ,				A_				:       int							) -> None:
												snake_case							:  Optional[int]			=     F"""{func.__name__}({value})"""
												snake_case							:  Optional[int]			=     timeit(F"""__main__.{call}"""     ,				setup='''import __main__'''							)
												print(F"""{call}: {func(A_							)} -- {timing} seconds"""							)

						for value in (262144, 1125899906842624, 1267650600228229401496703205376):
												for func in (num_digits, num_digits_fast, num_digits_faster):
																		benchmark_a_function(A_     ,				A_							)
												print()


if __name__ == "__main__":
						import doctest

						doctest.testmod()
						benchmark()

