






"""simple docstring"""

import math

def 	__lowerCamelCase			(						__UpperCamelCase )		->					Optional[Any]:

		"""simple docstring"""







		lowerCAmelCase_     :							Union[str, Any]             =    0
		if n % 2 == 0:
				count += 1
				while n % 2 == 0:
						lowerCAmelCase_     :							List[Any]             =    int(n / 2 )
    # the n input value must be odd so that
    # we can skip one element (ie i += 2)

		lowerCAmelCase_     :							Dict             =    3

		while i <= int(math.sqrt(__UpperCamelCase ) ):
				if n % i == 0:
						count += 1
						while n % i == 0:
								lowerCAmelCase_     :							List[Any]             =    int(n / i )
				lowerCAmelCase_     :							Dict             =    i + 2

		# this condition checks the prime
		# number n is greater than 2

		if n > 2:
				count += 1
		return count


if __name__ == "__main__":
					lowercase__      =				51242183
					print(F"""The number of distinct prime factors is/are {exact_prime_factor_count(n)}""")
					print(F"""The value of log(log(n)) is {math.log(math.log(n)):.4f}""")








"""simple docstring"""

from .pipeline_kandinskya_a import KandinskyVaaPipeline
from .pipeline_kandinsky2_2_controlnet import KandinskyVaaControlnetPipeline
from .pipeline_kandinsky2_2_controlnet_img2img import KandinskyVaaControlnetImgaImgPipeline
from .pipeline_kandinsky2_2_img2img import KandinskyVaaImgaImgPipeline
from .pipeline_kandinsky2_2_inpainting import KandinskyVaaInpaintPipeline
from .pipeline_kandinsky2_2_prior import KandinskyVaaPriorPipeline
from .pipeline_kandinsky2_2_prior_emb2emb import KandinskyVaaPriorEmbaEmbPipeline
