





'''simple docstring'''






snake_case_     			=						[
    [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(	UpperCamelCase__     :			int     ,							UpperCamelCase__     :			int     ,							UpperCamelCase__     :			int     ,							UpperCamelCase__     :			int		)		->	bool:
    return 0 <= row < rows and 0 <= col < cols
def 				_lowerCamelCase(	UpperCamelCase__     :			int     ,							UpperCamelCase__     :			int     ,							UpperCamelCase__     :			set     ,							UpperCamelCase__     :			list[list[int]]		)		->	int:
    A							:							str				=    len(UpperCamelCase_		)
    A							:							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 				_lowerCamelCase(	UpperCamelCase__     :			list[list[int]]		)		->	int:
    A							:							Any				=    set()

    A							:							Tuple				=    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
                A							:							int				=    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()








"""simple docstring"""




import math






def 							lowerCAmelCase			(   UpperCamelCase_:				int       )							->				list:







  '''simple docstring'''







  if n <= 0:
    raise ValueError("Only positive integers have prime factors"       )
  _a					      =						[]
  while n % 2 == 0:
    pf.append(2       )
    _a					      =						int(n / 2       )
  for i in range(3  ,			int(math.sqrt(UpperCamelCase_       )       ) + 1  ,			2       ):
    while n % i == 0:
      pf.append(UpperCamelCase_       )
      _a					      =						int(n / i       )
  if n > 2:
    pf.append(UpperCamelCase_       )
  return pf






def 							lowerCAmelCase			(   UpperCamelCase_:				int       )							->				int:







  '''simple docstring'''







  if n <= 0:
    raise ValueError("Only positive numbers are accepted"       )
  _a					      =						1
  _a					      =						1
  while n % 2 == 0:
    temp += 1
    _a					      =						int(n / 2       )
  div *= temp
  for i in range(3  ,			int(math.sqrt(UpperCamelCase_       )       ) + 1  ,			2       ):
    _a					      =						1
    while n % i == 0:
      temp += 1
      _a					      =						int(n / i       )
    div *= temp
  if n > 1:
    div *= 2
  return div






def 							lowerCAmelCase			(   UpperCamelCase_:				int       )							->				int:







  '''simple docstring'''







  if n <= 0:
    raise ValueError("Only positive numbers are accepted"       )
  _a					      =						1
  _a					      =						1
  while n % 2 == 0:
    temp += 1
    _a					      =						int(n / 2       )
  if temp > 1:
    s *= (2**temp - 1) / (2 - 1)
  for i in range(3  ,			int(math.sqrt(UpperCamelCase_       )       ) + 1  ,			2       ):
    _a					      =						1
    while n % i == 0:
      temp += 1
      _a					      =						int(n / i       )
    if temp > 1:
      s *= (i**temp - 1) / (i - 1)
  return int(UpperCamelCase_       )






def 							lowerCAmelCase			(   UpperCamelCase_:				int       )							->				int:







  '''simple docstring'''







  _a					      =						n
  for x in set(prime_factors(UpperCamelCase_       )       ):
    s *= (x - 1) / x
  return int(UpperCamelCase_       )


if __name__ == "__main__":
     import doctest

     doctest.testmod()


