




"""simple docstring"""
def 						UpperCAmelCase				(			A__:    Tuple							,				A__:    List[Any]							,				A__:    Optional[int]=False     )  ->     List[str]:

			if isinstance(A__							,				A__     ) and isinstance(A__							,				A__     ):
						__lowerCamelCase					:	Optional[Any]	       =				len(set_a.intersection(A__     )     )

						if alternative_union:
									__lowerCamelCase					:	Any	       =				len(A__     ) + len(A__     )
						else:
									__lowerCamelCase					:	str	       =				len(set_a.union(A__     )     )

						return intersection / union

			if isinstance(A__							,				(list, tuple)     ) and isinstance(A__							,				(list, tuple)     ):
						__lowerCamelCase					:	Dict	       =				[element for element in set_a if element in set_b]

						if alternative_union:
									__lowerCamelCase					:	Dict	       =				len(A__     ) + len(A__     )
									return len(A__     ) / union
						else:
									__lowerCamelCase					:	List[Any]	       =				set_a + [element for element in set_b if element not in set_a]
									return len(A__     ) / len(A__     )

						return len(A__     ) / len(A__     )
			return None


if __name__ == "__main__":
					a_				:    Optional[Any]										=     {'''a''', '''b''', '''c''', '''d''', '''e'''}
					a_				:    Optional[Any]										=     {'''c''', '''d''', '''e''', '''f''', '''h''', '''i'''}
					print(jaccard_similarity(set_a, set_b))









"""simple docstring"""
def 						UpperCAmelCase				(			A__:    Dict     )  ->     Optional[int]:
			stooge(A__							,				0							,				len(A__     ) - 1     )
			return arr





def 						UpperCAmelCase				(			A__:    Dict							,				A__:    List[str]							,				A__:    Optional[int]     )  ->     Any:
			if i >= h:
						return

			# If first element is smaller than the last then swap them
			if arr[i] > arr[h]:
						__lowerCamelCase       ,      __lowerCamelCase					:	Dict	       =				arr[h], arr[i]

			# If there are more than 2 elements in the array
			if h - i + 1 > 2:
						__lowerCamelCase					:	str	       =				(int)((h - i + 1) / 3     )

						# Recursively sort first 2/3 elements
						stooge(A__							,				A__							,				(h - t)     )

						# Recursively sort last 2/3 elements
						stooge(A__							,				i + t							,				(A__)     )

						# Recursively sort first 2/3 elements
						stooge(A__							,				A__							,				(h - t)     )


if __name__ == "__main__":
					a_				:    Tuple										=     input('''Enter numbers separated by a comma:\n''').strip()
					a_				:    Optional[Any]										=     [int(item) for item in user_input.split(''',''')]
					print(stooge_sort(unsorted))



