





import math
import unittest




def 	lowerCAmelCase_					(						__UpperCAmelCase:    int   )   ->			int:
    assert isinstance(_A	,     _A   ) and (
        number >= 0
    ), "'number' must been an int and positive"

    if 1 < number < 4:
        # 2 and 3 are primes
        return True
    elif number < 2 or number % 2 == 0 or number % 3 == 0:
        # Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
        return False

    # All primes number are in format of 6k +/- 1
    for i in range(5	,     int(math.sqrt(_A   ) + 1   )	,     6   ):
        if number % i == 0 or number % (i + 2) == 0:
            return False
    return True






class 					lowercase__ (			unittest.TestCase       ):

   '''simple docstring'''


   def    UpperCamelCase__						(					self							)				->   Any:






       """simple docstring"""
       self.assertTrue(is_prime(2							)							)
       self.assertTrue(is_prime(3							)							)
       self.assertTrue(is_prime(5							)							)
       self.assertTrue(is_prime(7							)							)
       self.assertTrue(is_prime(11							)							)
       self.assertTrue(is_prime(13							)							)
       self.assertTrue(is_prime(17							)							)
       self.assertTrue(is_prime(19							)							)
       self.assertTrue(is_prime(23							)							)
       self.assertTrue(is_prime(29							)							)




   def    UpperCamelCase__						(					self							)				->   Union[str, Any]:






       """simple docstring"""



       with self.assertRaises(__lowerCamelCase							):
           is_prime(-19							)
       self.assertFalse(
           is_prime(0							),	'''Zero doesn\'t have any positive factors, primes must have exactly two.''',	)
       self.assertFalse(
           is_prime(1							),	'''One only has 1 positive factor, primes must have exactly two.''',	)
       self.assertFalse(is_prime(2 * 2							)							)
       self.assertFalse(is_prime(2 * 3							)							)
       self.assertFalse(is_prime(3 * 3							)							)
       self.assertFalse(is_prime(3 * 5							)							)
       self.assertFalse(is_prime(3 * 5 * 7							)							)


if __name__ == "__main__":
    unittest.main()








# Lint as: python3
import itertools
import os
import re


UpperCAmelCase_  							=				re.compile(R'([A-Z]+)([A-Z][a-z])')
UpperCAmelCase_  							=				re.compile(R'([a-z\d])([A-Z])')

UpperCAmelCase_  							=				re.compile(R'(?<!_)_(?!_)')
UpperCAmelCase_  							=				re.compile(R'(_{2,})')

UpperCAmelCase_  							=				R'^\w+(\.\w+)*$'

UpperCAmelCase_  							=				R'<>:/\|?*'




def 	lowerCAmelCase_					(						__UpperCAmelCase:    Optional[int]   )   ->			List[Any]:
    UpperCamelCase__							:       int      =   _uppercase_uppercase_re.sub(r'''\1_\2'''	,     __UpperCAmelCase   )
    UpperCamelCase__							:       Tuple      =   _lowercase_uppercase_re.sub(r'''\1_\2'''	,     __UpperCAmelCase   )
    return name.lower()




def 	lowerCAmelCase_					(						__UpperCAmelCase:    Any   )   ->			Any:
    UpperCamelCase__							:       Optional[int]      =   _single_underscore_re.split(__UpperCAmelCase   )
    UpperCamelCase__							:       Dict      =   [_multiple_underscores_re.split(__UpperCAmelCase   ) for n in name]
    return "".join(n.capitalize() for n in itertools.chain.from_iterable(__UpperCAmelCase   ) if n != ''''''   )




def 	lowerCAmelCase_					(						__UpperCAmelCase:    int   )   ->			Union[str, Any]:
    if os.path.basename(__UpperCAmelCase   ) != name:
        raise ValueError(f"Should be a dataset name, not a path: {name}"   )
    return camelcase_to_snakecase(__UpperCAmelCase   )




def 	lowerCAmelCase_					(						__UpperCAmelCase:    Dict	,     __UpperCAmelCase:    Optional[int]   )   ->			Optional[Any]:
    if os.path.basename(__UpperCAmelCase   ) != name:
        raise ValueError(f"Should be a dataset name, not a path: {name}"   )
    if not re.match(_split_re	,     __UpperCAmelCase   ):
        raise ValueError(f"Split name should match '{_split_re}'' but got '{split}'."   )
    return f"{filename_prefix_for_name(__UpperCAmelCase   )}-{split}"




def 	lowerCAmelCase_					(						__UpperCAmelCase:    str	,     __UpperCAmelCase:    Dict	,     __UpperCAmelCase:    List[Any]	,     __UpperCAmelCase:    List[Any]=None   )   ->			Union[str, Any]:
    UpperCamelCase__							:       Optional[Any]      =   filename_prefix_for_split(__UpperCAmelCase	,     __UpperCAmelCase   )
    if filetype_suffix:
        prefix += f".{filetype_suffix}"
    UpperCamelCase__							:       Dict      =   os.path.join(__UpperCAmelCase	,     __UpperCAmelCase   )
    return f"{filepath}*"





def 	lowerCAmelCase_					(						__UpperCAmelCase:    List[str]	,     __UpperCAmelCase:    List[str]	,     __UpperCAmelCase:    int	,     __UpperCAmelCase:    str=None	,     __UpperCAmelCase:    Tuple=None   )   ->			Tuple:
    UpperCamelCase__							:       str      =   filename_prefix_for_split(__UpperCAmelCase	,     __UpperCAmelCase   )
    UpperCamelCase__							:       Tuple      =   os.path.join(__UpperCAmelCase	,     __UpperCAmelCase   )

    if shard_lengths:
        UpperCamelCase__							:       Optional[Any]      =   len(__UpperCAmelCase   )
        UpperCamelCase__							:       List[str]      =   [f"{prefix}-{shard_id:05d}-of-{num_shards:05d}" for shard_id in range(__UpperCAmelCase   )]
        if filetype_suffix:
            UpperCamelCase__							:       Union[str, Any]      =   [filename + f".{filetype_suffix}" for filename in filenames]
        return filenames
    else:
        UpperCamelCase__							:       Tuple      =   prefix
        if filetype_suffix:
            filename += f".{filetype_suffix}"
        return [filename]

