



def 		SCREAMING_SNAKE_CASE     (     snake_case__				,   snake_case__				,   snake_case__=False      )   ->	List[str]:

    if isinstance(SCREAMING_SNAKE_CASE__				,   SCREAMING_SNAKE_CASE__      ) and isinstance(SCREAMING_SNAKE_CASE__				,   SCREAMING_SNAKE_CASE__      ):
        __UpperCAmelCase			 =len(set_a.intersection(SCREAMING_SNAKE_CASE__      )      )

        if alternative_union:
            __UpperCAmelCase			 =len(SCREAMING_SNAKE_CASE__      ) + len(SCREAMING_SNAKE_CASE__      )
        else:
            __UpperCAmelCase			 =len(set_a.union(SCREAMING_SNAKE_CASE__      )      )

        return intersection / union

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

        if alternative_union:
            __UpperCAmelCase			 =len(SCREAMING_SNAKE_CASE__      ) + len(SCREAMING_SNAKE_CASE__      )
            return len(SCREAMING_SNAKE_CASE__      ) / union
        else:
            __UpperCAmelCase			 =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__":
       UpperCamelCase_	   =			{"""a""", """b""", """c""", """d""", """e"""}
       UpperCamelCase_	   =			{"""c""", """d""", """e""", """f""", """h""", """i"""}
       print(jaccard_similarity(set_a, set_b))











'''simple docstring'''



from math import isqrt



def  __UpperCAmelCase						(					SCREAMING_SNAKE_CASE__:						int     )	->      bool:

   """simple docstring"""
   return all(number % divisor != 0 for divisor in range(2,       isqrt(SCREAMING_SNAKE_CASE__     ) + 1     )     )



def  __UpperCAmelCase						(					SCREAMING_SNAKE_CASE__:						int = 10**6     )	->      int:

   """simple docstring"""
   __a					  =     0
   __a					  =     1
   __a					  =     7
   while prime_candidate < max_prime:
      primes_count += is_prime(SCREAMING_SNAKE_CASE__     )

      cube_index += 1
      prime_candidate += 6 * cube_index

   return primes_count


if __name__ == "__main__":
 print(f"""{solution() = }""")