"""simple docstring"""
def    lowerCAmelCase__    (			_UpperCamelCase       :				str ,			_UpperCamelCase       :				str					)					->				str:





						"""simple docstring"""






						if not (isinstance(_UpperCamelCase ,			_UpperCamelCase					) and isinstance(_UpperCamelCase ,			_UpperCamelCase					)):
												raise ValueError('longest_common_substring() takes two strings for inputs'					)

						snake_case								=			len(_UpperCamelCase					)
						snake_case								=			len(_UpperCamelCase					)

						snake_case								=			[[0] * (texta_length + 1) for _ in range(texta_length + 1					)]
						snake_case								=			0
						snake_case								=			0

						for i in range(1 ,			texta_length + 1					):
												for j in range(1 ,			texta_length + 1					):
																		if texta[i - 1] == texta[j - 1]:
																								snake_case								=			1 + dp[i - 1][j - 1]
																								if dp[i][j] > ans_length:
																														snake_case								=			i
																														snake_case								=			dp[i][j]

						return texta[ans_index - ans_length : ans_index]


if __name__ == "__main__":
					import doctest

					doctest.testmod()



"""simple docstring"""
def    lowerCAmelCase__    (			_UpperCamelCase       :				int ,			_UpperCamelCase       :				int					)					->				int:





						"""simple docstring"""






						return int((input_a, input_a).count(0					) == 0					)





def    lowerCAmelCase__    (			)					->				None:





						"""simple docstring"""






						assert and_gate(0 ,			0					) == 0
						assert and_gate(0 ,			1					) == 0
						assert and_gate(1 ,			0					) == 0
						assert and_gate(1 ,			1					) == 1


if __name__ == "__main__":
					test_and_gate()
					print(and_gate(1, 0))
					print(and_gate(0, 0))
					print(and_gate(0, 1))
					print(and_gate(1, 1))


