
_A	  =					[
    [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__				(						a__  :  Optional[int]	,      a__  :  List[Any]	,      a__  :  Optional[int]	,      a__  :  List[str]     ):
       return 0 <= row < rows and 0 <= col < cols




def 				lowerCamelCase__				(						a__  :  Union[str, Any]	,      a__  :  Optional[int]	,      a__  :  str	,      a__  :  Tuple     ):
       UpperCamelCase_							       =       len(__lowerCAmelCase     )
       UpperCamelCase_							       =       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__				(						a__  :  Tuple     ):
       UpperCamelCase_							       =       set()

       UpperCamelCase_							       =       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
                            UpperCamelCase_							       =       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()





def 				lowerCamelCase__				(						a__  :  float	,      a__  :  float	,      a__  :  float     )		->	float:
       if mass < 0:
              raise ValueError("""The mass of the body cannot be negative"""     )
       if radius <= 0:
              raise ValueError("""The radius is always a positive non zero integer"""     )
       return (mass * (velocity) ** 2) / radius


if __name__ == "__main__":
      import doctest

      doctest.testmod(verbose=True)



