




__a			:	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  a_		(							__snake_case     ,		__snake_case     ,		__snake_case     ,		__snake_case					)	->			bool:

			'''simple docstring'''


			return 0 <= row < rows and 0 <= col < cols




def  a_		(							__snake_case     ,		__snake_case     ,		__snake_case     ,		__snake_case					)	->			int:

			'''simple docstring'''


			UpperCamelCase_     				= len(__snake_case					)
			UpperCamelCase_     				= len(mat[0]					)
			if is_safe(__snake_case     ,		__snake_case     ,		__snake_case     ,		__snake_case					) and (row, col) not in seen and mat[row][col] == 1:
						seen.add((row, col)					)
						return (
						    1
						    + depth_first_search(row + 1     ,		__snake_case     ,		__snake_case     ,		__snake_case					)
						    + depth_first_search(row - 1     ,		__snake_case     ,		__snake_case     ,		__snake_case					)
						    + depth_first_search(__snake_case     ,		col + 1     ,		__snake_case     ,		__snake_case					)
						    + depth_first_search(__snake_case     ,		col - 1     ,		__snake_case     ,		__snake_case					)
						)
			else:
						return 0




def  a_		(							__snake_case					)	->			int:

			'''simple docstring'''


			UpperCamelCase_     				= set()

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


if __name__ == "__main__":
				import doctest

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






from collections import Counter




def  a_		(							__snake_case					)	->			int:

			'''simple docstring'''


			return sum(socks_by_color // 2 for socks_by_color in Counter(__snake_case					).values()					)


if __name__ == "__main__":
				import doctest

				doctest.testmod()

				__a			:	List[Any]							     =		[int(x) for x in input("""Enter socks by color :""").rstrip().split()]
				print(f"""sock_merchant({colors}) = {sock_merchant(colors)}""")
