



def   lowerCAmelCase__						(							_SCREAMING_SNAKE_CASE       :			Tuple				,     _SCREAMING_SNAKE_CASE       :			Tuple				,     _SCREAMING_SNAKE_CASE       :			Tuple=False    )     ->   Optional[int]:
				"""simple docstring"""







				if isinstance(_SCREAMING_SNAKE_CASE				,     _SCREAMING_SNAKE_CASE    ) and isinstance(_SCREAMING_SNAKE_CASE				,     _SCREAMING_SNAKE_CASE    ):
								__a       =		len(set_a.intersection(_SCREAMING_SNAKE_CASE    )    )

								if alternative_union:
												__a       =		len(_SCREAMING_SNAKE_CASE    ) + len(_SCREAMING_SNAKE_CASE    )
								else:
												__a       =		len(set_a.union(_SCREAMING_SNAKE_CASE    )    )

								return intersection / union

				if isinstance(_SCREAMING_SNAKE_CASE				,     (list, tuple)    ) and isinstance(_SCREAMING_SNAKE_CASE				,     (list, tuple)    ):
								__a       =		[element for element in set_a if element in set_b]

								if alternative_union:
												__a       =		len(_SCREAMING_SNAKE_CASE    ) + len(_SCREAMING_SNAKE_CASE    )
												return len(_SCREAMING_SNAKE_CASE    ) / union
								else:
												__a       =		set_a + [element for element in set_b if element not in set_a]
												return len(_SCREAMING_SNAKE_CASE    ) / len(_SCREAMING_SNAKE_CASE    )

								return len(_SCREAMING_SNAKE_CASE    ) / len(_SCREAMING_SNAKE_CASE    )
				return None


if __name__ == "__main__":
						lowerCamelCase__			= {"""a""", """b""", """c""", """d""", """e"""}
						lowerCamelCase__			= {"""c""", """d""", """e""", """f""", """h""", """i"""}
						print(jaccard_similarity(set_a, set_b))





import os

def   lowerCAmelCase__						(							):
				"""simple docstring"""







				__a       =		os.path.dirname(os.path.realpath(_SCREAMING_SNAKE_CASE    )    )
				__a       =		os.path.join(_SCREAMING_SNAKE_CASE				,     """triangle.txt"""    )

				with open(_SCREAMING_SNAKE_CASE    ) as f:
								__a       =		f.readlines()

				__a       =		[]
				for line in triangle:
								__a       =		[]
								for number in line.strip().split(""" """    ):
												numbers_from_line.append(int(_SCREAMING_SNAKE_CASE    )    )
								a.append(_SCREAMING_SNAKE_CASE    )

				for i in range(1				,     len(_SCREAMING_SNAKE_CASE    )    ):
								for j in range(len(a[i]    )    ):
												__a       =		a[i - 1][j] if j != len(a[i - 1]    ) else 0
												__a       =		a[i - 1][j - 1] if j > 0 else 0
												a[i][j] += max(_SCREAMING_SNAKE_CASE				,     _SCREAMING_SNAKE_CASE    )
				return max(a[-1]    )


if __name__ == "__main__":
						print(solution())
